/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:58:22,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:58:22,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:58:22,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:58:22,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:58:22,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:58:22,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:58:22,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:58:22,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:58:22,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:58:22,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:58:22,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:58:22,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:58:22,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:58:22,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:58:22,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:58:22,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:58:22,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:58:22,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:58:22,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:58:22,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:58:22,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:58:22,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:58:22,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:58:22,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:58:22,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:58:22,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:58:22,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:58:22,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:58:22,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:58:22,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:58:22,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:58:22,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:58:22,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:58:22,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:58:22,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:58:22,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:58:22,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:58:22,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:58:22,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:58:22,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:58:22,683 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:58:22,697 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:58:22,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:58:22,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:58:22,699 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:58:22,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:58:22,699 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:58:22,699 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:58:22,700 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:58:22,700 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:58:22,700 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:58:22,700 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:58:22,700 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:58:22,700 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:58:22,701 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:58:22,701 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:58:22,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:58:22,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:58:22,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:58:22,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:58:22,702 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:58:22,702 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:58:22,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:58:22,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:58:22,702 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:58:22,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:58:22,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:58:22,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:58:22,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:58:22,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:58:22,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:58:22,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:58:22,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:58:22,892 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:58:22,892 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:58:22,893 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:58:22,967 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_gS2j9T/tmp/9458c146a11f4f38b9f8fe39fc6d823e/FLAGc3a0c1a57 [2020-07-01 12:58:23,300 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:58:23,301 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:58:23,301 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:58:23,308 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_gS2j9T/tmp/9458c146a11f4f38b9f8fe39fc6d823e/FLAGc3a0c1a57 [2020-07-01 12:58:23,718 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_gS2j9T/tmp/9458c146a11f4f38b9f8fe39fc6d823e [2020-07-01 12:58:23,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:58:23,731 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:58:23,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:58:23,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:58:23,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:58:23,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b49229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23, skipping insertion in model container [2020-07-01 12:58:23,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:58:23,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:58:24,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:58:24,017 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:58:24,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:58:24,052 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:58:24,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24 WrapperNode [2020-07-01 12:58:24,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:58:24,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:58:24,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:58:24,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:58:24,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:58:24,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:58:24,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:58:24,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:58:24,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:58:24,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:58:24,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:58:24,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:58:24,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:58:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:58:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:58:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:58:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:58:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:58:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:58:24,468 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:58:24,468 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:58:24,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24 BoogieIcfgContainer [2020-07-01 12:58:24,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:58:24,473 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:58:24,473 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:58:24,475 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:58:24,476 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,491 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges [2020-07-01 12:58:24,492 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:58:24,493 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:58:24,494 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:58:24,494 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:58:24,496 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:58:24,497 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:58:24,497 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:58:24,524 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:58:24,554 INFO L200 BlockEncoder]: SBE split 14 edges [2020-07-01 12:58:24,559 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-07-01 12:58:24,560 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:58:24,589 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:58:24,591 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-07-01 12:58:24,593 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:58:24,593 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:58:24,594 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:58:24,594 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:58:24,595 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 39 edges [2020-07-01 12:58:24,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24 BasicIcfg [2020-07-01 12:58:24,595 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:58:24,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:58:24,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:58:24,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:58:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:58:23" (1/4) ... [2020-07-01 12:58:24,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (2/4) ... [2020-07-01 12:58:24,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (3/4) ... [2020-07-01 12:58:24,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24" (4/4) ... [2020-07-01 12:58:24,604 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:58:24,615 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:58:24,685 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-07-01 12:58:24,699 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-07-01 12:58:24,723 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:58:24,723 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:58:24,723 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:58:24,723 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:58:24,723 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:58:24,723 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:58:24,724 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:58:24,724 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:58:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-01 12:58:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:58:24,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:24,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:58:24,746 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 169792299, now seen corresponding path program 1 times [2020-07-01 12:58:24,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:24,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558835106] [2020-07-01 12:58:24,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:24,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558835106] [2020-07-01 12:58:24,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:24,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:24,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806259125] [2020-07-01 12:58:24,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:24,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:24,968 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 12:58:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,077 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2020-07-01 12:58:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:58:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,093 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:58:25,093 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:58:25,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:58:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:58:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:58:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-07-01 12:58:25,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 [2020-07-01 12:58:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,136 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-07-01 12:58:25,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. [2020-07-01 12:58:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:58:25,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:58:25,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:58:25,137 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash 169792301, now seen corresponding path program 1 times [2020-07-01 12:58:25,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089401769] [2020-07-01 12:58:25,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089401769] [2020-07-01 12:58:25,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955841939] [2020-07-01 12:58:25,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,185 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 3 states. [2020-07-01 12:58:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,258 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-07-01 12:58:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:58:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,260 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:58:25,260 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:58:25,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:58:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:58:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:58:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-07-01 12:58:25,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 [2020-07-01 12:58:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,266 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-07-01 12:58:25,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-07-01 12:58:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:58:25,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:58:25,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:58:25,267 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 169792302, now seen corresponding path program 1 times [2020-07-01 12:58:25,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162718141] [2020-07-01 12:58:25,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162718141] [2020-07-01 12:58:25,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:58:25,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954373744] [2020-07-01 12:58:25,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:58:25,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:58:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:58:25,305 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. [2020-07-01 12:58:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,361 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-07-01 12:58:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:58:25,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:58:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,363 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:58:25,363 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:58:25,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:58:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:58:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:58:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:58:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-07-01 12:58:25,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 [2020-07-01 12:58:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,368 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-07-01 12:58:25,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:58:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-07-01 12:58:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:58:25,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:58:25,369 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash 968593264, now seen corresponding path program 1 times [2020-07-01 12:58:25,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85057458] [2020-07-01 12:58:25,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85057458] [2020-07-01 12:58:25,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:58:25,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416264201] [2020-07-01 12:58:25,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:58:25,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:58:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:58:25,410 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 4 states. [2020-07-01 12:58:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,463 INFO L93 Difference]: Finished difference Result 21 states and 35 transitions. [2020-07-01 12:58:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:58:25,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:58:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,464 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:58:25,464 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:58:25,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:58:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:58:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:58:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:58:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2020-07-01 12:58:25,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 6 [2020-07-01 12:58:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,469 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. [2020-07-01 12:58:25,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:58:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. [2020-07-01 12:58:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:58:25,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:58:25,470 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,471 INFO L82 PathProgramCache]: Analyzing trace with hash 968593265, now seen corresponding path program 1 times [2020-07-01 12:58:25,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856954364] [2020-07-01 12:58:25,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856954364] [2020-07-01 12:58:25,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586362898] [2020-07-01 12:58:25,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,511 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 3 states. [2020-07-01 12:58:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,568 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-07-01 12:58:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:58:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,569 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:58:25,569 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:58:25,570 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:58:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:58:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:58:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-07-01 12:58:25,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-07-01 12:58:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,574 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-07-01 12:58:25,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-07-01 12:58:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:58:25,574 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:58:25,575 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash 968593262, now seen corresponding path program 1 times [2020-07-01 12:58:25,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113749766] [2020-07-01 12:58:25,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113749766] [2020-07-01 12:58:25,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461404290] [2020-07-01 12:58:25,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,608 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. [2020-07-01 12:58:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,652 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2020-07-01 12:58:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:58:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,654 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:58:25,654 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:58:25,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:58:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:58:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:58:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2020-07-01 12:58:25,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 6 [2020-07-01 12:58:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,659 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. [2020-07-01 12:58:25,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2020-07-01 12:58:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:58:25,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:58:25,660 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752123, now seen corresponding path program 1 times [2020-07-01 12:58:25,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059708081] [2020-07-01 12:58:25,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059708081] [2020-07-01 12:58:25,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:58:25,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849699349] [2020-07-01 12:58:25,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:58:25,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:58:25,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:58:25,716 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 5 states. [2020-07-01 12:58:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,837 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2020-07-01 12:58:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:58:25,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:58:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,838 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:58:25,838 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:58:25,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:58:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:58:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:58:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:58:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-07-01 12:58:25,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 8 [2020-07-01 12:58:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,843 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-07-01 12:58:25,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:58:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2020-07-01 12:58:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:58:25,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:58:25,845 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752121, now seen corresponding path program 1 times [2020-07-01 12:58:25,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413993295] [2020-07-01 12:58:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413993295] [2020-07-01 12:58:25,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:58:25,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356842835] [2020-07-01 12:58:25,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:58:25,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:58:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:58:25,895 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand 5 states. [2020-07-01 12:58:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,982 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-07-01 12:58:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:58:25,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:58:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,983 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:58:25,983 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:58:25,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:58:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:58:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-01 12:58:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:58:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-07-01 12:58:25,989 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 8 [2020-07-01 12:58:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,990 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-07-01 12:58:25,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:58:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-07-01 12:58:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:58:25,990 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:58:25,991 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1189752120, now seen corresponding path program 1 times [2020-07-01 12:58:25,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061549320] [2020-07-01 12:58:25,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061549320] [2020-07-01 12:58:26,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:26,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:58:26,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115018656] [2020-07-01 12:58:26,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:58:26,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:58:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:58:26,082 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 7 states. [2020-07-01 12:58:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:26,230 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2020-07-01 12:58:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:58:26,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 12:58:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:26,232 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:58:26,232 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:58:26,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:58:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:58:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:58:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:58:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-07-01 12:58:26,237 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 [2020-07-01 12:58:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:26,237 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-07-01 12:58:26,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:58:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-01 12:58:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:58:26,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:26,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:26,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:58:26,239 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -890467848, now seen corresponding path program 1 times [2020-07-01 12:58:26,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:26,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600253653] [2020-07-01 12:58:26,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600253653] [2020-07-01 12:58:26,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:26,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:58:26,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029840323] [2020-07-01 12:58:26,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:58:26,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:58:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:58:26,289 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2020-07-01 12:58:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:26,365 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-01 12:58:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:58:26,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:58:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:26,366 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:58:26,367 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:58:26,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:58:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:58:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:58:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:58:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-07-01 12:58:26,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 10 [2020-07-01 12:58:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:26,371 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-07-01 12:58:26,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:58:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-07-01 12:58:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:58:26,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:26,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:26,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:58:26,372 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -890467846, now seen corresponding path program 1 times [2020-07-01 12:58:26,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:26,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223792023] [2020-07-01 12:58:26,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223792023] [2020-07-01 12:58:26,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:26,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:58:26,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365996589] [2020-07-01 12:58:26,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:58:26,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:58:26,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:58:26,434 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 6 states. [2020-07-01 12:58:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:26,518 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. [2020-07-01 12:58:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:58:26,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:58:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:26,519 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:58:26,520 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:58:26,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:58:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:58:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-01 12:58:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:58:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-07-01 12:58:26,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 10 [2020-07-01 12:58:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:26,524 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 12:58:26,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:58:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-07-01 12:58:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:58:26,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:26,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:26,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:58:26,526 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -890467845, now seen corresponding path program 1 times [2020-07-01 12:58:26,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:26,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015378297] [2020-07-01 12:58:26,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015378297] [2020-07-01 12:58:26,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:26,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:58:26,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811562068] [2020-07-01 12:58:26,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:58:26,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:58:26,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:58:26,612 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 7 states. [2020-07-01 12:58:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:26,724 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-07-01 12:58:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:58:26,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 12:58:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:26,725 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:58:26,726 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:58:26,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:58:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:58:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-01 12:58:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:58:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-07-01 12:58:26,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2020-07-01 12:58:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:26,730 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-01 12:58:26,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:58:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-07-01 12:58:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:58:26,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:26,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:26,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:58:26,732 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1041090507, now seen corresponding path program 1 times [2020-07-01 12:58:26,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:26,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77482048] [2020-07-01 12:58:26,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77482048] [2020-07-01 12:58:26,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:26,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:26,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062547024] [2020-07-01 12:58:26,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:26,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:26,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:26,769 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2020-07-01 12:58:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:26,801 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2020-07-01 12:58:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:26,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:58:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:26,802 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:58:26,802 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:58:26,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:58:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:58:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:58:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-07-01 12:58:26,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 12 [2020-07-01 12:58:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:26,807 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-07-01 12:58:26,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-07-01 12:58:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:26,808 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:26,808 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:26,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:58:26,808 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:26,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash 240598607, now seen corresponding path program 1 times [2020-07-01 12:58:26,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:26,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947651058] [2020-07-01 12:58:26,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947651058] [2020-07-01 12:58:26,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147982971] [2020-07-01 12:58:26,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:26,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:58:26,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:26,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:26,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:58:26,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546752356] [2020-07-01 12:58:26,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:58:26,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:26,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:58:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:58:26,985 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 8 states. [2020-07-01 12:58:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:27,137 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-07-01 12:58:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:58:27,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-01 12:58:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:27,138 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:58:27,138 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:58:27,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:58:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:58:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:58:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:58:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-01 12:58:27,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 14 [2020-07-01 12:58:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:27,143 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-01 12:58:27,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:58:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-07-01 12:58:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:27,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:27,144 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:27,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 12:58:27,345 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 240598608, now seen corresponding path program 1 times [2020-07-01 12:58:27,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:27,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373472895] [2020-07-01 12:58:27,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:27,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373472895] [2020-07-01 12:58:27,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:27,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 12:58:27,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666996957] [2020-07-01 12:58:27,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:58:27,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:58:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:58:27,487 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 9 states. [2020-07-01 12:58:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:27,760 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2020-07-01 12:58:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:58:27,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:58:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:27,762 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:58:27,762 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 12:58:27,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:58:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 12:58:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2020-07-01 12:58:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:58:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-07-01 12:58:27,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 14 [2020-07-01 12:58:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:27,770 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-07-01 12:58:27,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:58:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2020-07-01 12:58:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:27,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:27,771 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:27,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:58:27,771 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash 240662130, now seen corresponding path program 1 times [2020-07-01 12:58:27,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:27,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872610988] [2020-07-01 12:58:27,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:27,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872610988] [2020-07-01 12:58:27,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240880483] [2020-07-01 12:58:27,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:27,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:58:27,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:27,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-07-01 12:58:27,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837463727] [2020-07-01 12:58:27,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:58:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:58:27,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:58:27,914 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 9 states. [2020-07-01 12:58:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:28,061 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-01 12:58:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:58:28,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:58:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:28,063 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:58:28,063 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:58:28,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:58:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:58:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-01 12:58:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:58:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-07-01 12:58:28,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2020-07-01 12:58:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:28,070 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-07-01 12:58:28,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:58:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-07-01 12:58:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:28,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:28,071 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:28,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 12:58:28,272 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 240662131, now seen corresponding path program 1 times [2020-07-01 12:58:28,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:28,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10375874] [2020-07-01 12:58:28,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:28,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10375874] [2020-07-01 12:58:28,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432659137] [2020-07-01 12:58:28,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:28,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:58:28,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:28,529 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:28,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:58:28,584 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:28,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:58:28,591 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:28,611 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:28,614 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:58:28,615 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:58:28,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:28,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:58:28,759 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:28,760 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:28,773 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:28,775 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:28,779 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:28,780 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:58:28,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:58:28,823 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:28,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:28,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-07-01 12:58:28,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60910601] [2020-07-01 12:58:28,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:58:28,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:58:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:58:28,828 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 14 states. [2020-07-01 12:58:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:29,633 INFO L93 Difference]: Finished difference Result 47 states and 72 transitions. [2020-07-01 12:58:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:58:29,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-01 12:58:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:29,634 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:58:29,634 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:58:29,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:58:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:58:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2020-07-01 12:58:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:58:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 12:58:29,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 14 [2020-07-01 12:58:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:29,644 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 12:58:29,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:58:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 12:58:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:29,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:29,645 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:29,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:58:29,847 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash 240628399, now seen corresponding path program 1 times [2020-07-01 12:58:29,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:29,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720299401] [2020-07-01 12:58:29,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:29,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720299401] [2020-07-01 12:58:29,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:29,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 12:58:29,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962507840] [2020-07-01 12:58:29,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:58:29,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:58:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:58:29,965 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 9 states. [2020-07-01 12:58:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:30,169 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2020-07-01 12:58:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:58:30,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:58:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:30,171 INFO L225 Difference]: With dead ends: 72 [2020-07-01 12:58:30,171 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:58:30,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:58:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:58:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-07-01 12:58:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:58:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2020-07-01 12:58:30,180 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 14 [2020-07-01 12:58:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:30,180 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2020-07-01 12:58:30,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:58:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2020-07-01 12:58:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:30,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:30,181 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:30,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:58:30,182 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash 240692883, now seen corresponding path program 1 times [2020-07-01 12:58:30,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:30,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530797888] [2020-07-01 12:58:30,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:30,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530797888] [2020-07-01 12:58:30,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919042483] [2020-07-01 12:58:30,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:30,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:58:30,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:30,412 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:30,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:58:30,431 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:30,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:58:30,440 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:30,460 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:30,463 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:58:30,463 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:58:30,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:30,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:58:30,574 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:30,575 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:30,589 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:30,591 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:30,592 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:30,593 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:58:30,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:58:30,623 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:30,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:30,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-07-01 12:58:30,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717143309] [2020-07-01 12:58:30,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:58:30,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:58:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:58:30,627 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 14 states. [2020-07-01 12:58:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:31,311 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2020-07-01 12:58:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:58:31,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-01 12:58:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:31,313 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:58:31,313 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 12:58:31,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:58:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 12:58:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2020-07-01 12:58:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:58:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2020-07-01 12:58:31,322 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 14 [2020-07-01 12:58:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:31,323 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-07-01 12:58:31,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:58:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2020-07-01 12:58:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:31,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:31,324 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:31,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:31,525 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash -452285215, now seen corresponding path program 1 times [2020-07-01 12:58:31,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:31,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699452508] [2020-07-01 12:58:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:31,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699452508] [2020-07-01 12:58:31,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351038786] [2020-07-01 12:58:31,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:31,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-01 12:58:31,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:31,781 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_22|]} [2020-07-01 12:58:31,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:58:31,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:58:31,787 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,796 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:31,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:58:31,803 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,826 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:31,827 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,827 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:58:31,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:58:31,855 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,865 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:31,865 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:58:31,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:58:31,908 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:31,921 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:31,923 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:58:31,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:58:32,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:32,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:58:32,029 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:32,030 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:32,045 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:32,047 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:32,048 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:58:32,049 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:32,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2020-07-01 12:58:32,098 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:32,137 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:32,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:32,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-01 12:58:32,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511796157] [2020-07-01 12:58:32,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:58:32,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:58:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:58:32,198 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 19 states. [2020-07-01 12:58:32,726 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2020-07-01 12:58:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:33,035 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2020-07-01 12:58:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:58:33,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-07-01 12:58:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:33,037 INFO L225 Difference]: With dead ends: 78 [2020-07-01 12:58:33,037 INFO L226 Difference]: Without dead ends: 77 [2020-07-01 12:58:33,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:58:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-01 12:58:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2020-07-01 12:58:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 12:58:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. [2020-07-01 12:58:33,050 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 93 transitions. Word has length 14 [2020-07-01 12:58:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:33,050 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 93 transitions. [2020-07-01 12:58:33,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:58:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 93 transitions. [2020-07-01 12:58:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:58:33,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:33,051 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:33,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:33,252 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -452255424, now seen corresponding path program 1 times [2020-07-01 12:58:33,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:33,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627233294] [2020-07-01 12:58:33,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:33,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627233294] [2020-07-01 12:58:33,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143420026] [2020-07-01 12:58:33,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:33,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-01 12:58:33,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:33,472 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_23|]} [2020-07-01 12:58:33,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:58:33,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:58:33,477 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,486 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:58:33,491 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,499 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,500 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,500 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:58:33,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:58:33,527 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,535 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,536 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:58:33,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:58:33,574 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,585 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,587 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:58:33,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:58:33,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:58:33,682 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:33,683 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:33,696 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:33,697 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:33,698 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:58:33,699 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:33,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2020-07-01 12:58:33,746 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:33,781 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:33,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:33,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-01 12:58:33,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284186142] [2020-07-01 12:58:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:58:33,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:58:33,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:58:33,833 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. Second operand 19 states. [2020-07-01 12:58:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:34,647 INFO L93 Difference]: Finished difference Result 95 states and 140 transitions. [2020-07-01 12:58:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:58:34,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-07-01 12:58:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:34,649 INFO L225 Difference]: With dead ends: 95 [2020-07-01 12:58:34,649 INFO L226 Difference]: Without dead ends: 94 [2020-07-01 12:58:34,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:58:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-01 12:58:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 52. [2020-07-01 12:58:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 12:58:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2020-07-01 12:58:34,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 14 [2020-07-01 12:58:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:34,660 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2020-07-01 12:58:34,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:58:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2020-07-01 12:58:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:58:34,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:34,661 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:34,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:34,863 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash 581494507, now seen corresponding path program 2 times [2020-07-01 12:58:34,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:34,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730604040] [2020-07-01 12:58:34,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:35,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730604040] [2020-07-01 12:58:35,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682153813] [2020-07-01 12:58:35,089 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:35,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:58:35,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:58:35,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-01 12:58:35,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:35,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:35,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:58:35,156 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:35,173 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:58:35,173 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:35,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:58:35,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:58:35,194 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:35,196 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:35,196 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:35,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:58:35,265 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:35,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:58:35,266 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:35,267 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:35,276 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:35,277 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:35,278 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:58:35,278 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-07-01 12:58:35,310 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:58:35,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:35,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-07-01 12:58:35,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696964916] [2020-07-01 12:58:35,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:58:35,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:35,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:58:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:58:35,314 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 16 states. [2020-07-01 12:58:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:36,069 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2020-07-01 12:58:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 12:58:36,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-07-01 12:58:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:36,071 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:58:36,071 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:58:36,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:58:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:58:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2020-07-01 12:58:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:58:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2020-07-01 12:58:36,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 18 [2020-07-01 12:58:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:36,077 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2020-07-01 12:58:36,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:58:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2020-07-01 12:58:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:58:36,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:36,078 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:36,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:36,279 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1405328983, now seen corresponding path program 2 times [2020-07-01 12:58:36,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:36,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420655451] [2020-07-01 12:58:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:36,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420655451] [2020-07-01 12:58:36,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317688496] [2020-07-01 12:58:36,626 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:36,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:58:36,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:58:36,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-01 12:58:36,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:36,677 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_24|]} [2020-07-01 12:58:36,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:58:36,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:58:36,681 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:36,687 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:58:36,691 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:36,697 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,698 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:36,698 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:58:36,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:58:36,724 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:36,732 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,733 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:58:36,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:58:36,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:58:36,768 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:36,777 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,779 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:58:36,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:58:36,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:58:36,900 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:36,900 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:36,915 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:36,917 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:36,918 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:58:36,919 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:58:36,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2020-07-01 12:58:36,957 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:36,988 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:58:36,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:36,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-01 12:58:36,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081309456] [2020-07-01 12:58:36,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:58:36,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:58:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:58:36,993 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 18 states. [2020-07-01 12:58:37,547 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2020-07-01 12:58:37,735 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-07-01 12:58:38,220 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-01 12:58:38,418 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-07-01 12:58:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:38,743 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2020-07-01 12:58:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-01 12:58:38,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2020-07-01 12:58:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:38,744 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:58:38,744 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:58:38,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2020-07-01 12:58:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:58:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2020-07-01 12:58:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:58:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2020-07-01 12:58:38,751 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 20 [2020-07-01 12:58:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:38,752 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-01 12:58:38,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:58:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-01 12:58:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:58:38,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:38,752 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:38,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 12:58:38,953 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:58:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1405299192, now seen corresponding path program 1 times [2020-07-01 12:58:38,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:38,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015529703] [2020-07-01 12:58:38,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:39,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015529703] [2020-07-01 12:58:39,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718076246] [2020-07-01 12:58:39,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:39,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-01 12:58:39,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:58:39,330 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_25|]} [2020-07-01 12:58:39,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:58:39,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:58:39,336 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,345 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:58:39,353 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,361 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,362 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,362 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:58:39,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:58:39,392 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,398 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,398 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 12:58:39,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 12:58:39,438 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:58:39,444 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,445 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:58:39,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 12:58:39,539 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 12:58:39,540 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:39,540 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:58:39,551 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:58:39,552 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:58:39,553 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:58:39,553 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-07-01 12:58:39,588 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:39,616 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:58:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:58:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:58:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-01 12:58:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527741479] [2020-07-01 12:58:39,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:58:39,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:58:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:58:39,621 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 18 states. [2020-07-01 12:58:40,170 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-07-01 12:58:40,722 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-07-01 12:58:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:40,960 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2020-07-01 12:58:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-01 12:58:40,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2020-07-01 12:58:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:40,961 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:58:40,961 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:58:40,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:58:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:58:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:58:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:58:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:58:40,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-01 12:58:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:40,963 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:58:40,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:58:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:58:40,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:58:41,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:58:41,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:58:41,647 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 225 [2020-07-01 12:58:41,761 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 165 [2020-07-01 12:58:44,564 WARN L192 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 219 DAG size of output: 116 [2020-07-01 12:58:56,488 WARN L192 SmtUtils]: Spent 11.92 s on a formula simplification. DAG size of input: 160 DAG size of output: 104 [2020-07-01 12:58:56,492 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-01 12:58:56,492 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 27) no Hoare annotation was computed. [2020-07-01 12:58:56,492 INFO L268 CegarLoopResult]: For program point L25-1(lines 25 28) no Hoare annotation was computed. [2020-07-01 12:58:56,492 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 12:58:56,493 INFO L264 CegarLoopResult]: At program point L25-3(lines 25 28) the Hoare annotation is: (let ((.cse1 (select |#length| ULTIMATE.start_cstrcspn_~p~0.base)) (.cse24 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse18 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse29 (select |#length| ULTIMATE.start_cstrcspn_~spanp~0.base))) (let ((.cse11 (= 0 ULTIMATE.start_cstrcspn_~spanp~0.offset)) (.cse19 (<= 1 .cse29)) (.cse2 (= .cse18 ULTIMATE.start_main_~length1~0)) (.cse25 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse20 (<= 1 ULTIMATE.start_cstrcspn_~spanp~0.offset)) (.cse21 (<= (+ ULTIMATE.start_cstrcspn_~spanp~0.offset 1) .cse29)) (.cse22 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~p~0.base)) (.cse26 (<= ULTIMATE.start_cstrcspn_~p~0.offset 1)) (.cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (- 1))))) (.cse8 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~p~0.base))) (.cse0 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse10 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse24) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse12 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~spanp~0.base) (+ .cse29 (- 1))))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~spanp~0.base))) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse27 (<= 1 .cse1)) (.cse23 (= 0 ULTIMATE.start_cstrcspn_~c~0)) (.cse28 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (.cse15 (<= 1 ULTIMATE.start_cstrcspn_~p~0.offset)) (.cse16 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse17 (exists ((v_prenex_2 Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset v_prenex_2) (<= (+ v_prenex_2 1) (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) v_prenex_2)))))) (or (and .cse0 (<= ULTIMATE.start_cstrcspn_~p~0.offset .cse1) (let ((.cse3 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse18 (- 1)))))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 1 .cse18) .cse19) (and .cse2 .cse20 .cse21 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_main_~length1~0) .cse12 .cse14 .cse13 .cse15 .cse16 .cse17))) .cse22 (or (<= (+ ULTIMATE.start_cstrcspn_~p~0.offset 1) .cse1) .cse23) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrcspn_~p~0.base)))) .cse24 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~p~0.base) (+ .cse1 (- 1))))) (and .cse2 .cse25 .cse22 .cse4 .cse5 .cse24 .cse6 .cse26 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse23 .cse28 .cse15 .cse16 .cse17 .cse19) (and .cse2 .cse25 .cse20 .cse21 .cse22 .cse4 .cse5 .cse24 .cse7 .cse26 .cse6 .cse8 .cse9 .cse0 .cse10 .cse12 .cse14 .cse13 .cse27 .cse23 .cse28 .cse15 .cse16 .cse17)))) [2020-07-01 12:58:56,493 INFO L268 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-07-01 12:58:56,493 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-01 12:58:56,493 INFO L268 CegarLoopResult]: For program point L36(lines 36 38) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point L36-2(lines 33 47) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point L26-2(lines 26 27) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 29) the Hoare annotation is: (let ((.cse5 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse15 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base)) (.cse4 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrcspn_~p~0.base))))) (.cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrcspn_~s2.base) (- 1))))) (.cse10 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse16 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse17 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~p~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrcspn_~p~0.base) (- 1))))))) (.cse13 (select |#length| ULTIMATE.start_cstrcspn_~p~0.base)) (.cse0 (= .cse15 ULTIMATE.start_main_~length1~0)) (.cse1 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~p~0.base)) (.cse8 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~p~0.base))) (.cse11 (or (and (< 1 ULTIMATE.start_main_~length2~0) .cse5) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse18 (exists ((v_prenex_2 Int)) (and (<= ULTIMATE.start_cstrcspn_~s2.offset v_prenex_2) (<= (+ v_prenex_2 1) (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) v_prenex_2))))) (.cse19 (<= 1 .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_cstrcspn_~p~0.offset) .cse12 (<= 1 .cse13) (= 0 (select .cse14 (+ .cse15 (- 1)))) .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (select |#length| ULTIMATE.start_cstrcspn_~spanp~0.base))) (and (= 0 (select .cse14 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse15 (- 1)))) .cse4 .cse5 .cse6 (<= ULTIMATE.start_cstrcspn_~spanp~0.offset .cse20) .cse10 (or (= ULTIMATE.start_cstrcspn_~sc~0 0) (<= (+ ULTIMATE.start_cstrcspn_~spanp~0.offset 1) .cse20)) .cse12 (<= 1 ULTIMATE.start_cstrcspn_~p~0.offset) .cse16 .cse17 (<= (+ ULTIMATE.start_cstrcspn_~p~0.offset 1) .cse13) .cse0 (<= 1 ULTIMATE.start_cstrcspn_~spanp~0.offset) .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse11 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~spanp~0.base) (+ .cse20 (- 1)))) (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~spanp~0.base)) .cse18 .cse19))))) [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:58:56,494 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point L39-1(lines 39 41) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 45) no Hoare annotation was computed. [2020-07-01 12:58:56,495 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-07-01 12:58:56,498 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:58:56,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,554 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:56 BasicIcfg [2020-07-01 12:58:56,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:58:56,604 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:58:56,604 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:58:56,607 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:58:56,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:56,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:58:23" (1/5) ... [2020-07-01 12:58:56,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33aef4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:58:56, skipping insertion in model container [2020-07-01 12:58:56,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:56,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:24" (2/5) ... [2020-07-01 12:58:56,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33aef4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:58:56, skipping insertion in model container [2020-07-01 12:58:56,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:56,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (3/5) ... [2020-07-01 12:58:56,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33aef4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:58:56, skipping insertion in model container [2020-07-01 12:58:56,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:56,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24" (4/5) ... [2020-07-01 12:58:56,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33aef4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:58:56, skipping insertion in model container [2020-07-01 12:58:56,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:56,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:56" (5/5) ... [2020-07-01 12:58:56,612 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:58:56,633 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:58:56,633 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:58:56,633 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:58:56,633 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:58:56,633 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:58:56,633 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:58:56,633 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:58:56,634 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:58:56,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 12:58:56,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:58:56,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:58:56,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:58:56,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:56,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:56,646 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:58:56,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 12:58:56,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:58:56,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:58:56,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:58:56,647 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:56,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:58:56,653 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [150] ULTIMATE.startENTRY-->L36: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 24#L36true [102] L36-->L36-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 21#L36-2true [79] L36-2-->L39-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 6#L39-1true [121] L39-1-->L44: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 19#L44true [95] L44-->L44-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 16#L44-1true [151] L44-1-->L22-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (<= 1 .cse0) (= v_ULTIMATE.start_cstrcspn_~s1.base_5 v_ULTIMATE.start_cstrcspn_~p~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_5) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrcspn_~s1.offset_4 v_ULTIMATE.start_cstrcspn_~p~0.offset_7) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_7|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_8|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_7|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_4, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_6|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_8, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_6, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_5, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_7|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_5|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_8, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_4|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~p~0.offset, ULTIMATE.start_cstrcspn_#t~mem1, ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, #memory_int, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_~sc~0] 12#L22-2true [2020-07-01 12:58:56,653 INFO L796 eck$LassoCheckResult]: Loop: 12#L22-2true [70] L22-2-->L23: Formula: (and (= |v_ULTIMATE.start_cstrcspn_#t~post0.base_2| v_ULTIMATE.start_cstrcspn_~p~0.base_5) (= v_ULTIMATE.start_cstrcspn_~p~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post0.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| v_ULTIMATE.start_cstrcspn_~p~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~p~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_5, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_5} OutVars{ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_2|, ULTIMATE.start_cstrcspn_~p~0.base=v_ULTIMATE.start_cstrcspn_~p~0.base_4, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_2|, ULTIMATE.start_cstrcspn_~p~0.offset=v_ULTIMATE.start_cstrcspn_~p~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~p~0.base, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~p~0.offset] 20#L23true [152] L23-->L25-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrcspn_~s2.base_5 v_ULTIMATE.start_cstrcspn_~spanp~0.base_7) (= v_ULTIMATE.start_cstrcspn_~c~0_7 (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrcspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|)) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7 v_ULTIMATE.start_cstrcspn_~s2.offset_5)) InVars {ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_9|} OutVars{ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_7, ULTIMATE.start_cstrcspn_#t~post0.offset=|v_ULTIMATE.start_cstrcspn_#t~post0.offset_7|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_5, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_#t~post0.base=|v_ULTIMATE.start_cstrcspn_#t~post0.base_8|, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_7, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_cstrcspn_#t~mem1=|v_ULTIMATE.start_cstrcspn_#t~mem1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_#t~post0.offset, ULTIMATE.start_cstrcspn_#t~post0.base, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_~c~0, ULTIMATE.start_cstrcspn_#t~mem1] 17#L25-3true [73] L25-3-->L26: Formula: (and (= v_ULTIMATE.start_cstrcspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrcspn_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5) (= v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrcspn_#t~post2.base_2| v_ULTIMATE.start_cstrcspn_~spanp~0.base_5)) InVars {ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_5, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~spanp~0.offset=v_ULTIMATE.start_cstrcspn_~spanp~0.offset_4, ULTIMATE.start_cstrcspn_~spanp~0.base=v_ULTIMATE.start_cstrcspn_~spanp~0.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~spanp~0.offset, ULTIMATE.start_cstrcspn_~spanp~0.base, ULTIMATE.start_cstrcspn_#t~post2.offset] 3#L26true [153] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_cstrcspn_~sc~0_9 |v_ULTIMATE.start_cstrcspn_#t~mem3_7|) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) 1) (<= 0 |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|) (= |v_ULTIMATE.start_cstrcspn_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|)) (<= (+ |v_ULTIMATE.start_cstrcspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrcspn_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_8|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_~sc~0] 22#L26-2true [140] L26-2-->L25-1: Formula: (> v_ULTIMATE.start_cstrcspn_~sc~0_5 v_ULTIMATE.start_cstrcspn_~c~0_5) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_7|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_5, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_6|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3] 23#L25-1true [82] L25-1-->L22-2: Formula: (= 0 v_ULTIMATE.start_cstrcspn_~sc~0_6) InVars {ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_6} OutVars{ULTIMATE.start_cstrcspn_~sc~0=v_ULTIMATE.start_cstrcspn_~sc~0_6} AuxVars[] AssignedVars[] 12#L22-2true [2020-07-01 12:58:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:56,654 INFO L82 PathProgramCache]: Analyzing trace with hash 983581043, now seen corresponding path program 1 times [2020-07-01 12:58:56,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:56,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178686604] [2020-07-01 12:58:56,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:56,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178686604] [2020-07-01 12:58:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:56,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:56,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857488649] [2020-07-01 12:58:56,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:58:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1260721655, now seen corresponding path program 1 times [2020-07-01 12:58:56,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:56,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778668941] [2020-07-01 12:58:56,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:58:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:58:56,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:58:56,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:56,779 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 12:58:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:56,815 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-07-01 12:58:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:56,818 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:58:56,821 INFO L168 Benchmark]: Toolchain (without parser) took 33091.06 ms. Allocated memory was 649.6 MB in the beginning and 965.2 MB in the end (delta: 315.6 MB). Free memory was 561.7 MB in the beginning and 828.6 MB in the end (delta: -266.9 MB). Peak memory consumption was 48.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,822 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:58:56,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.68 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 561.7 MB in the beginning and 649.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 687.9 MB. Free memory was 649.5 MB in the beginning and 647.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,823 INFO L168 Benchmark]: Boogie Preprocessor took 28.99 ms. Allocated memory is still 687.9 MB. Free memory was 647.4 MB in the beginning and 646.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,823 INFO L168 Benchmark]: RCFGBuilder took 346.58 ms. Allocated memory is still 687.9 MB. Free memory was 646.3 MB in the beginning and 621.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,824 INFO L168 Benchmark]: BlockEncodingV2 took 122.73 ms. Allocated memory is still 687.9 MB. Free memory was 621.9 MB in the beginning and 613.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,824 INFO L168 Benchmark]: TraceAbstraction took 32006.59 ms. Allocated memory was 687.9 MB in the beginning and 965.2 MB in the end (delta: 277.3 MB). Free memory was 612.2 MB in the beginning and 870.7 MB in the end (delta: -258.5 MB). Peak memory consumption was 507.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,824 INFO L168 Benchmark]: BuchiAutomizer took 216.28 ms. Allocated memory is still 965.2 MB. Free memory was 870.7 MB in the beginning and 828.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:56,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 36 edges - StatisticsResult: Encoded RCFG 22 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.68 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 561.7 MB in the beginning and 649.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 687.9 MB. Free memory was 649.5 MB in the beginning and 647.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.99 ms. Allocated memory is still 687.9 MB. Free memory was 647.4 MB in the beginning and 646.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 346.58 ms. Allocated memory is still 687.9 MB. Free memory was 646.3 MB in the beginning and 621.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 122.73 ms. Allocated memory is still 687.9 MB. Free memory was 621.9 MB in the beginning and 613.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 32006.59 ms. Allocated memory was 687.9 MB in the beginning and 965.2 MB in the end (delta: 277.3 MB). Free memory was 612.2 MB in the beginning and 870.7 MB in the end (delta: -258.5 MB). Peak memory consumption was 507.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 216.28 ms. Allocated memory is still 965.2 MB. Free memory was 870.7 MB in the beginning and 828.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2020-07-01 12:58:56,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((0 == nondetString1 && p <= unknown-#length-unknown[p]) && ((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && s1 == p) && 0 == nondetString2) && 1 == \valid[p]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == spanp) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[nondetString1]) && 1 == \valid[spanp]) && 1 <= p) && 0 == s2) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])) && 1 <= unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[spanp]) || (((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= spanp) && spanp + 1 <= unknown-#length-unknown[spanp]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && s1 == p) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 == nondetString2) && 1 == \valid[p]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 1 <= length1) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[spanp]) && 1 == \valid[nondetString1]) && 1 <= p) && 0 == s2) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])))) && !(nondetString1 == nondetString2)) && (p + 1 <= unknown-#length-unknown[p] || 0 == c)) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) || (((((((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && p <= 1) && s1 == p) && 0 == nondetString2) && 1 == \valid[p]) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == spanp) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[nondetString1]) && 1 == \valid[spanp]) && 1 <= unknown-#length-unknown[p]) && 0 == c) && 1 == nondetString1 + length1) && 1 <= p) && 0 == s2) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])) && 1 <= unknown-#length-unknown[spanp])) || (((((((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 <= spanp) && spanp + 1 <= unknown-#length-unknown[spanp]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && s1 == p) && p <= 1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 == nondetString2) && 1 == \valid[p]) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[spanp]) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[p]) && 0 == c) && 1 == nondetString1 + length1) && 1 <= p) && 0 == s2) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])) - InvariantResult [Line: 22]: Loop Invariant [2020-07-01 12:58:56,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:58:56,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:58:56,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:58:56,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 12:58:56,893 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,893 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:56,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:58:56,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && s1 == p) && 0 == nondetString2) && 1 == \valid[p]) && 0 == nondetString1) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == p) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 0 == s2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1])) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])) && 1 <= unknown-#length-unknown[nondetString1]) || ((((((((((((((((((((((((0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && spanp <= unknown-#length-unknown[spanp]) && 0 == nondetString1) && (sc == 0 || spanp + 1 <= unknown-#length-unknown[spanp])) && 1 == \valid[nondetString1]) && 1 <= p) && 0 == s2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1])) && p + 1 <= unknown-#length-unknown[p]) && unknown-#length-unknown[nondetString1] == length1) && 1 <= spanp) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && 1 == \valid[nondetString2]) && s1 == p) && 0 == nondetString2) && 1 == \valid[p]) && ((1 < length2 && unknown-#length-unknown[nondetString2] == length2) || 1 == length2 + nondetString2)) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 1 == \valid[spanp]) && (\exists v_prenex_2 : int :: (s2 <= v_prenex_2 && v_prenex_2 + 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][v_prenex_2])) && 1 <= unknown-#length-unknown[nondetString1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 9 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.4s, OverallIterations: 24, TraceHistogramMax: 3, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 167 SDtfs, 1409 SDslu, 1140 SDs, 0 SdLazy, 2516 SolverSat, 394 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 147 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 21 NumberOfFragments, 963 HoareAnnotationTreeSize, 2 FomulaSimplifications, 882905 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 2 FomulaSimplificationsInter, 94976 FormulaSimplificationTreeSizeReductionInter, 14.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 378 ConstructedInterpolants, 29 QuantifiedInterpolants, 62443 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 33 InterpolantComputations, 15 PerfectInterpolantSequences, 12/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:58:20.442 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_gS2j9T/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:58:57.129 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check