java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:05:41,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:41,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:41,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:41,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:41,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:41,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:41,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:41,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:41,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:41,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:41,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:41,436 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:41,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:41,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:41,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:41,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:41,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:41,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:41,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:41,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:41,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:41,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:41,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:41,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:41,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:41,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:41,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:41,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:41,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:41,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:41,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:41,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:41,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:41,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:41,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:41,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:05:41,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:41,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:41,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:05:41,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:05:41,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:41,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:41,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:05:41,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:41,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:41,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:41,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:41,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:41,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:05:41,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:05:41,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:05:41,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:41,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:41,512 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:41,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:05:41,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:41,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:05:41,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:05:41,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:05:41,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:41,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:41,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:05:41,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:05:41,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:05:41,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:05:41,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:05:41,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:05:41,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:41,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:41,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:41,583 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:41,584 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:41,584 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_true-unreach-call_ground.i [2018-11-23 12:05:41,650 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba05909/abafa22206b4470aa1359cc0b7dd3aa6/FLAGce5eaf9a7 [2018-11-23 12:05:42,151 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:42,151 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_true-unreach-call_ground.i [2018-11-23 12:05:42,159 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba05909/abafa22206b4470aa1359cc0b7dd3aa6/FLAGce5eaf9a7 [2018-11-23 12:05:42,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba05909/abafa22206b4470aa1359cc0b7dd3aa6 [2018-11-23 12:05:42,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:42,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:42,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:42,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:42,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:42,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42, skipping insertion in model container [2018-11-23 12:05:42,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:42,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:42,744 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:42,748 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:42,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:42,800 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:42,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42 WrapperNode [2018-11-23 12:05:42,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:42,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:42,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:42,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:42,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:42,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:42,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:42,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:42,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... [2018-11-23 12:05:42,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:42,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:42,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:42,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:42,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:05:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:05:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:05:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:05:42,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:05:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:05:42,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:05:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:43,561 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:43,562 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:05:43,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:43 BoogieIcfgContainer [2018-11-23 12:05:43,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:43,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:05:43,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:05:43,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:05:43,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:42" (1/3) ... [2018-11-23 12:05:43,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ba3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:43, skipping insertion in model container [2018-11-23 12:05:43,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:42" (2/3) ... [2018-11-23 12:05:43,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ba3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:43, skipping insertion in model container [2018-11-23 12:05:43,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:43" (3/3) ... [2018-11-23 12:05:43,574 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partition_true-unreach-call_ground.i [2018-11-23 12:05:43,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:05:43,592 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:05:43,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:05:43,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:43,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:05:43,643 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:05:43,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:05:43,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:43,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:43,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:05:43,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:43,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:05:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:05:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:05:43,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:43,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:43,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:43,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1738896191, now seen corresponding path program 1 times [2018-11-23 12:05:43,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:43,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:05:43,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:05:43,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:05:43,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #75#return; {32#true} is VALID [2018-11-23 12:05:43,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 12:05:43,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {32#true} is VALID [2018-11-23 12:05:43,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:05:43,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~a~0 := 0; {33#false} is VALID [2018-11-23 12:05:43,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~a~0 < 100000); {33#false} is VALID [2018-11-23 12:05:43,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 12:05:43,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:05:43,857 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {33#false} is VALID [2018-11-23 12:05:43,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:05:43,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:05:43,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:05:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:43,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:05:43,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:05:43,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:43,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:05:44,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:44,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:05:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:05:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:44,012 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:05:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,365 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-11-23 12:05:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:05:44,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:05:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-23 12:05:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2018-11-23 12:05:44,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2018-11-23 12:05:44,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:44,816 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:05:44,816 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:05:44,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:05:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:05:44,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:44,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:05:44,868 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:05:44,868 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:05:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,872 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:05:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:05:44,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,874 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:05:44,874 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:05:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,878 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:05:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:05:44,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:44,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:05:44,883 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-11-23 12:05:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:44,884 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:05:44,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:05:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:05:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:05:44,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:44,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:44,885 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:44,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 146058804, now seen corresponding path program 1 times [2018-11-23 12:05:44,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:44,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:44,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-23 12:05:44,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {179#true} is VALID [2018-11-23 12:05:44,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2018-11-23 12:05:44,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #75#return; {179#true} is VALID [2018-11-23 12:05:44,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret6 := main(); {179#true} is VALID [2018-11-23 12:05:44,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {179#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {181#(= main_~a~0 0)} is VALID [2018-11-23 12:05:44,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#(= main_~a~0 0)} assume !(~a~0 < 100000); {180#false} is VALID [2018-11-23 12:05:44,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {180#false} ~a~0 := 0; {180#false} is VALID [2018-11-23 12:05:44,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {180#false} assume !(~a~0 < 100000); {180#false} is VALID [2018-11-23 12:05:44,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {180#false} havoc ~x~0;~x~0 := 0; {180#false} is VALID [2018-11-23 12:05:44,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {180#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {180#false} is VALID [2018-11-23 12:05:44,983 INFO L256 TraceCheckUtils]: 11: Hoare triple {180#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {180#false} is VALID [2018-11-23 12:05:44,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {180#false} ~cond := #in~cond; {180#false} is VALID [2018-11-23 12:05:44,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {180#false} assume 0 == ~cond; {180#false} is VALID [2018-11-23 12:05:44,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-23 12:05:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:44,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:44,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:44,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:05:44,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:44,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:45,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:45,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:45,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:45,038 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 12:05:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,219 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 12:05:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:45,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:05:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:05:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:05:45,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:05:45,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:45,644 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:05:45,644 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:05:45,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:05:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-23 12:05:45,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:45,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-23 12:05:45,671 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-23 12:05:45,671 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-23 12:05:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,674 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 12:05:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 12:05:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:45,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:45,675 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-23 12:05:45,675 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-23 12:05:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:45,678 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 12:05:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 12:05:45,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:45,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:45,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:45,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:05:45,682 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2018-11-23 12:05:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:45,683 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:05:45,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:05:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:05:45,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:45,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:45,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:45,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1176205862, now seen corresponding path program 1 times [2018-11-23 12:05:45,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:45,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:45,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2018-11-23 12:05:45,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {341#true} is VALID [2018-11-23 12:05:45,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-23 12:05:45,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #75#return; {341#true} is VALID [2018-11-23 12:05:45,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {341#true} call #t~ret6 := main(); {341#true} is VALID [2018-11-23 12:05:45,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {341#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {343#(= main_~a~0 0)} is VALID [2018-11-23 12:05:45,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {343#(= main_~a~0 0)} is VALID [2018-11-23 12:05:45,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {343#(= main_~a~0 0)} is VALID [2018-11-23 12:05:45,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {343#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {344#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:45,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {344#(<= main_~a~0 1)} assume !(~a~0 < 100000); {342#false} is VALID [2018-11-23 12:05:45,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#false} ~a~0 := 0; {342#false} is VALID [2018-11-23 12:05:45,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {342#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {342#false} is VALID [2018-11-23 12:05:45,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {342#false} is VALID [2018-11-23 12:05:45,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {342#false} ~a~0 := 1 + ~a~0; {342#false} is VALID [2018-11-23 12:05:45,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {342#false} assume !(~a~0 < 100000); {342#false} is VALID [2018-11-23 12:05:45,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {342#false} havoc ~x~0;~x~0 := 0; {342#false} is VALID [2018-11-23 12:05:45,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {342#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {342#false} is VALID [2018-11-23 12:05:45,846 INFO L256 TraceCheckUtils]: 17: Hoare triple {342#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {342#false} is VALID [2018-11-23 12:05:45,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {342#false} ~cond := #in~cond; {342#false} is VALID [2018-11-23 12:05:45,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {342#false} assume 0 == ~cond; {342#false} is VALID [2018-11-23 12:05:45,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {342#false} assume !false; {342#false} is VALID [2018-11-23 12:05:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:05:45,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:45,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:45,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:46,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2018-11-23 12:05:46,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {341#true} is VALID [2018-11-23 12:05:46,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-23 12:05:46,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #75#return; {341#true} is VALID [2018-11-23 12:05:46,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {341#true} call #t~ret6 := main(); {341#true} is VALID [2018-11-23 12:05:46,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {341#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {363#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:46,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {363#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:46,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {363#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:46,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {344#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:46,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {344#(<= main_~a~0 1)} assume !(~a~0 < 100000); {342#false} is VALID [2018-11-23 12:05:46,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#false} ~a~0 := 0; {342#false} is VALID [2018-11-23 12:05:46,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {342#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {342#false} is VALID [2018-11-23 12:05:46,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {342#false} is VALID [2018-11-23 12:05:46,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {342#false} ~a~0 := 1 + ~a~0; {342#false} is VALID [2018-11-23 12:05:46,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {342#false} assume !(~a~0 < 100000); {342#false} is VALID [2018-11-23 12:05:46,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {342#false} havoc ~x~0;~x~0 := 0; {342#false} is VALID [2018-11-23 12:05:46,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {342#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {342#false} is VALID [2018-11-23 12:05:46,147 INFO L256 TraceCheckUtils]: 17: Hoare triple {342#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {342#false} is VALID [2018-11-23 12:05:46,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {342#false} ~cond := #in~cond; {342#false} is VALID [2018-11-23 12:05:46,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {342#false} assume 0 == ~cond; {342#false} is VALID [2018-11-23 12:05:46,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {342#false} assume !false; {342#false} is VALID [2018-11-23 12:05:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:05:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:05:46,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:05:46,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:46,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:05:46,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:05:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:05:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:46,272 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 12:05:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:46,968 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-23 12:05:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:46,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:05:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-23 12:05:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-23 12:05:46,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-23 12:05:47,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,126 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:05:47,126 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:05:47,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:05:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:05:47,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:47,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:05:47,149 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:05:47,150 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:05:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,153 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 12:05:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 12:05:47,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,155 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:05:47,155 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:05:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,158 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 12:05:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 12:05:47,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:47,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:47,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:47,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:05:47,162 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 21 [2018-11-23 12:05:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:47,162 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:05:47,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:05:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:05:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:05:47,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:47,164 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:47,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:47,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1720139252, now seen corresponding path program 2 times [2018-11-23 12:05:47,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:47,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:47,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:47,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:47,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-23 12:05:47,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {595#true} is VALID [2018-11-23 12:05:47,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-23 12:05:47,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #75#return; {595#true} is VALID [2018-11-23 12:05:47,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret6 := main(); {595#true} is VALID [2018-11-23 12:05:47,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {597#(= main_~a~0 0)} is VALID [2018-11-23 12:05:47,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {597#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {597#(= main_~a~0 0)} is VALID [2018-11-23 12:05:47,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {597#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {597#(= main_~a~0 0)} is VALID [2018-11-23 12:05:47,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {597#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {598#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {598#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {598#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {599#(<= main_~a~0 2)} is VALID [2018-11-23 12:05:47,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#(<= main_~a~0 2)} assume !(~a~0 < 100000); {596#false} is VALID [2018-11-23 12:05:47,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {596#false} ~a~0 := 0; {596#false} is VALID [2018-11-23 12:05:47,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {596#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {596#false} is VALID [2018-11-23 12:05:47,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {596#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {596#false} is VALID [2018-11-23 12:05:47,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {596#false} ~a~0 := 1 + ~a~0; {596#false} is VALID [2018-11-23 12:05:47,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {596#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {596#false} is VALID [2018-11-23 12:05:47,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {596#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {596#false} is VALID [2018-11-23 12:05:47,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {596#false} ~a~0 := 1 + ~a~0; {596#false} is VALID [2018-11-23 12:05:47,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {596#false} assume !(~a~0 < 100000); {596#false} is VALID [2018-11-23 12:05:47,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {596#false} havoc ~x~0;~x~0 := 0; {596#false} is VALID [2018-11-23 12:05:47,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {596#false} is VALID [2018-11-23 12:05:47,303 INFO L256 TraceCheckUtils]: 23: Hoare triple {596#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {596#false} is VALID [2018-11-23 12:05:47,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-23 12:05:47,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2018-11-23 12:05:47,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-23 12:05:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:05:47,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:47,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:47,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:47,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:47,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:47,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-23 12:05:47,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {595#true} is VALID [2018-11-23 12:05:47,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-23 12:05:47,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #75#return; {595#true} is VALID [2018-11-23 12:05:47,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret6 := main(); {595#true} is VALID [2018-11-23 12:05:47,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {595#true} is VALID [2018-11-23 12:05:47,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {595#true} is VALID [2018-11-23 12:05:47,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {595#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {595#true} is VALID [2018-11-23 12:05:47,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {595#true} ~a~0 := 1 + ~a~0; {595#true} is VALID [2018-11-23 12:05:47,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {595#true} is VALID [2018-11-23 12:05:47,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {595#true} is VALID [2018-11-23 12:05:47,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#true} ~a~0 := 1 + ~a~0; {595#true} is VALID [2018-11-23 12:05:47,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#true} assume !(~a~0 < 100000); {595#true} is VALID [2018-11-23 12:05:47,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#true} ~a~0 := 0; {642#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:47,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {642#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {642#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:47,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {642#(<= main_~a~0 0)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {642#(<= main_~a~0 0)} is VALID [2018-11-23 12:05:47,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {642#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {598#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {598#(<= main_~a~0 1)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {598#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:47,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {598#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {599#(<= main_~a~0 2)} is VALID [2018-11-23 12:05:47,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {599#(<= main_~a~0 2)} assume !(~a~0 < 100000); {596#false} is VALID [2018-11-23 12:05:47,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {596#false} havoc ~x~0;~x~0 := 0; {596#false} is VALID [2018-11-23 12:05:47,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {596#false} is VALID [2018-11-23 12:05:47,539 INFO L256 TraceCheckUtils]: 23: Hoare triple {596#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {596#false} is VALID [2018-11-23 12:05:47,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-23 12:05:47,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2018-11-23 12:05:47,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-23 12:05:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:05:47,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:47,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:05:47,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:05:47,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:47,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:05:47,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:05:47,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:05:47,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:47,632 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 6 states. [2018-11-23 12:05:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:47,832 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 12:05:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:05:47,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:05:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2018-11-23 12:05:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2018-11-23 12:05:47,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2018-11-23 12:05:47,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:47,989 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:05:47,989 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:05:47,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:05:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 12:05:48,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:48,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 12:05:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 12:05:48,011 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 12:05:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:48,016 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:05:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-23 12:05:48,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:48,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:48,017 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 12:05:48,017 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 12:05:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:48,020 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:05:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-23 12:05:48,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:48,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:48,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:48,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:05:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:05:48,024 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 27 [2018-11-23 12:05:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:48,024 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:05:48,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:05:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:05:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:05:48,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:48,026 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:48,026 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash -299978470, now seen corresponding path program 3 times [2018-11-23 12:05:48,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 12:05:48,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-23 12:05:48,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 12:05:48,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #75#return; {900#true} is VALID [2018-11-23 12:05:48,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret6 := main(); {900#true} is VALID [2018-11-23 12:05:48,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {902#(= main_~a~0 0)} is VALID [2018-11-23 12:05:48,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {902#(= main_~a~0 0)} is VALID [2018-11-23 12:05:48,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {902#(= main_~a~0 0)} is VALID [2018-11-23 12:05:48,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {903#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:48,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {903#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:48,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {903#(<= main_~a~0 1)} is VALID [2018-11-23 12:05:48,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {904#(<= main_~a~0 2)} is VALID [2018-11-23 12:05:48,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {904#(<= main_~a~0 2)} is VALID [2018-11-23 12:05:48,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {904#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {904#(<= main_~a~0 2)} is VALID [2018-11-23 12:05:48,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {904#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {905#(<= main_~a~0 3)} is VALID [2018-11-23 12:05:48,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#(<= main_~a~0 3)} assume !(~a~0 < 100000); {901#false} is VALID [2018-11-23 12:05:48,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} ~a~0 := 0; {901#false} is VALID [2018-11-23 12:05:48,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {901#false} is VALID [2018-11-23 12:05:48,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {901#false} is VALID [2018-11-23 12:05:48,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} ~a~0 := 1 + ~a~0; {901#false} is VALID [2018-11-23 12:05:48,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {901#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {901#false} is VALID [2018-11-23 12:05:48,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {901#false} is VALID [2018-11-23 12:05:48,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {901#false} ~a~0 := 1 + ~a~0; {901#false} is VALID [2018-11-23 12:05:48,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {901#false} is VALID [2018-11-23 12:05:48,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {901#false} is VALID [2018-11-23 12:05:48,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} ~a~0 := 1 + ~a~0; {901#false} is VALID [2018-11-23 12:05:48,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} assume !(~a~0 < 100000); {901#false} is VALID [2018-11-23 12:05:48,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} havoc ~x~0;~x~0 := 0; {901#false} is VALID [2018-11-23 12:05:48,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {901#false} is VALID [2018-11-23 12:05:48,179 INFO L256 TraceCheckUtils]: 29: Hoare triple {901#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {901#false} is VALID [2018-11-23 12:05:48,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2018-11-23 12:05:48,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID [2018-11-23 12:05:48,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 12:05:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:05:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:48,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:48,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:05:48,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:48,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:48,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 12:05:48,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:48,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:48,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-23 12:05:48,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:05:48,317 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (= 0 (select (store |v_#valid_13| |main_~#aa~0.base| 1) |main_~#bb~0.base|)) [2018-11-23 12:05:48,317 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) [2018-11-23 12:05:48,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 12:05:48,474 INFO L478 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 12:05:48,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:48,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:05:48,506 INFO L267 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. [2018-11-23 12:05:48,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:38 [2018-11-23 12:05:48,512 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:05:48,513 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|, |main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_6]. (let ((.cse0 (select (select |v_#memory_int_9| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= |#memory_int| (store |v_#memory_int_9| |main_~#bb~0.base| (store (select |v_#memory_int_9| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)) .cse0))) (<= 0 .cse0) (< main_~a~0 100000))) [2018-11-23 12:05:48,513 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_6]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= .cse0 (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (< main_~a~0 100000) (<= 0 .cse0))) [2018-11-23 12:05:49,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 12:05:49,113 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-23 12:05:49,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:05:49,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 [2018-11-23 12:05:49,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 12:05:49,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:05:49,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:05:49,188 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:55, output treesize:19 [2018-11-23 12:05:49,191 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:05:49,191 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|, v_main_~a~0_16, |main_~#aa~0.offset|, |main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_6]. (let ((.cse1 (select |#memory_int| |main_~#aa~0.base|))) (let ((.cse0 (select .cse1 (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= .cse0 (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 .cse0) (< main_~a~0 100000) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000) (<= (select .cse1 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|)))) [2018-11-23 12:05:49,191 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (< main_~a~0 100000))) (or (and .cse0 (or (<= 100000 main_~a~0) (<= main_~a~0 99998))) (and .cse0 (<= 0 |main_#t~mem2|)))) [2018-11-23 12:05:49,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 12:05:49,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-23 12:05:49,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 12:05:49,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #75#return; {900#true} is VALID [2018-11-23 12:05:49,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret6 := main(); {900#true} is VALID [2018-11-23 12:05:49,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:05:49,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {946#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))) (< main_~a~0 100000))} is VALID [2018-11-23 12:05:49,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {946#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))) (< main_~a~0 100000))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {950#(and (exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))))) (< main_~a~0 100000) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:05:49,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {950#(and (exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))))) (< main_~a~0 100000) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} ~a~0 := 1 + ~a~0; {954#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= main_~a~0 (+ v_main_~a~0_16 1)) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {954#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= main_~a~0 (+ v_main_~a~0_16 1)) (< v_main_~a~0_16 100000)))} assume !(~a~0 < 100000); {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} ~a~0 := 0; {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} ~a~0 := 1 + ~a~0; {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} ~a~0 := 1 + ~a~0; {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} is VALID [2018-11-23 12:05:49,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {958#(exists ((|main_~#bb~0.base| Int) (v_main_~a~0_16 Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_6 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|)) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_6)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_16) |main_~#aa~0.offset|))) (<= 99999 v_main_~a~0_16) (< v_main_~a~0_16 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {983#(or (<= main_~a~0 99998) (and (< main_~a~0 100000) (<= 0 |main_#t~mem2|)))} is VALID [2018-11-23 12:05:49,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {983#(or (<= main_~a~0 99998) (and (< main_~a~0 100000) (<= 0 |main_#t~mem2|)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {987#(<= main_~a~0 99998)} is VALID [2018-11-23 12:05:49,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {987#(<= main_~a~0 99998)} ~a~0 := 1 + ~a~0; {991#(<= main_~a~0 99999)} is VALID [2018-11-23 12:05:49,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {991#(<= main_~a~0 99999)} assume !(~a~0 < 100000); {901#false} is VALID [2018-11-23 12:05:49,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} havoc ~x~0;~x~0 := 0; {901#false} is VALID [2018-11-23 12:05:49,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {901#false} is VALID [2018-11-23 12:05:49,348 INFO L256 TraceCheckUtils]: 29: Hoare triple {901#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {901#false} is VALID [2018-11-23 12:05:49,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2018-11-23 12:05:49,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID [2018-11-23 12:05:49,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 12:05:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:05:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:49,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2018-11-23 12:05:49,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:05:49,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:49,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:05:49,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:05:49,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:05:49,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:49,459 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 14 states. [2018-11-23 12:05:54,303 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-23 12:06:08,882 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 12:06:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,932 INFO L93 Difference]: Finished difference Result 125 states and 169 transitions. [2018-11-23 12:06:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:06:13,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:06:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 160 transitions. [2018-11-23 12:06:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 160 transitions. [2018-11-23 12:06:13,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 160 transitions. [2018-11-23 12:06:22,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 156 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,679 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:06:22,679 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:06:22,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=620, Invalid=1828, Unknown=2, NotChecked=0, Total=2450 [2018-11-23 12:06:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:06:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2018-11-23 12:06:22,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 78 states. [2018-11-23 12:06:22,858 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 78 states. [2018-11-23 12:06:22,858 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 78 states. [2018-11-23 12:06:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,864 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2018-11-23 12:06:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2018-11-23 12:06:22,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,866 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 103 states. [2018-11-23 12:06:22,866 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 103 states. [2018-11-23 12:06:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,871 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2018-11-23 12:06:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2018-11-23 12:06:22,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:06:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-11-23 12:06:22,876 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 33 [2018-11-23 12:06:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,876 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-23 12:06:22,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:06:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-11-23 12:06:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:06:22,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,878 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:22,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash 759917430, now seen corresponding path program 1 times [2018-11-23 12:06:22,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-23 12:06:23,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1566#true} is VALID [2018-11-23 12:06:23,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-23 12:06:23,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #75#return; {1566#true} is VALID [2018-11-23 12:06:23,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2018-11-23 12:06:23,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {1568#(= main_~a~0 0)} is VALID [2018-11-23 12:06:23,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {1568#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1568#(= main_~a~0 0)} is VALID [2018-11-23 12:06:23,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {1568#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1568#(= main_~a~0 0)} is VALID [2018-11-23 12:06:23,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {1568#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {1569#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {1570#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {1573#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {1574#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:23,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {1574#(<= main_~a~0 6)} assume !(~a~0 < 100000); {1567#false} is VALID [2018-11-23 12:06:23,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} ~a~0 := 0; {1567#false} is VALID [2018-11-23 12:06:23,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,076 INFO L273 TraceCheckUtils]: 38: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {1567#false} assume !(#t~mem2 < 0);havoc #t~mem2; {1567#false} is VALID [2018-11-23 12:06:23,078 INFO L273 TraceCheckUtils]: 43: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {1567#false} assume !(~a~0 < 100000); {1567#false} is VALID [2018-11-23 12:06:23,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {1567#false} havoc ~x~0;~x~0 := 0; {1567#false} is VALID [2018-11-23 12:06:23,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {1567#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,078 INFO L256 TraceCheckUtils]: 47: Hoare triple {1567#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1567#false} is VALID [2018-11-23 12:06:23,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-23 12:06:23,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2018-11-23 12:06:23,079 INFO L273 TraceCheckUtils]: 50: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-23 12:06:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 12:06:23,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:23,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:23,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:23,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-23 12:06:23,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1566#true} is VALID [2018-11-23 12:06:23,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-23 12:06:23,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #75#return; {1566#true} is VALID [2018-11-23 12:06:23,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2018-11-23 12:06:23,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {1593#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:23,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {1593#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1593#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:23,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {1593#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1593#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:23,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1593#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1569#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:23,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1569#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1570#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:23,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {1570#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1571#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:23,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1572#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:23,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {1573#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1573#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:23,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {1574#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:23,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {1574#(<= main_~a~0 6)} assume !(~a~0 < 100000); {1567#false} is VALID [2018-11-23 12:06:23,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} ~a~0 := 0; {1567#false} is VALID [2018-11-23 12:06:23,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,467 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,468 INFO L273 TraceCheckUtils]: 37: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {1567#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {1567#false} is VALID [2018-11-23 12:06:23,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {1567#false} assume !(#t~mem2 < 0);havoc #t~mem2; {1567#false} is VALID [2018-11-23 12:06:23,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {1567#false} ~a~0 := 1 + ~a~0; {1567#false} is VALID [2018-11-23 12:06:23,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {1567#false} assume !(~a~0 < 100000); {1567#false} is VALID [2018-11-23 12:06:23,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {1567#false} havoc ~x~0;~x~0 := 0; {1567#false} is VALID [2018-11-23 12:06:23,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {1567#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1567#false} is VALID [2018-11-23 12:06:23,471 INFO L256 TraceCheckUtils]: 47: Hoare triple {1567#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1567#false} is VALID [2018-11-23 12:06:23,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-23 12:06:23,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2018-11-23 12:06:23,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-23 12:06:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 12:06:23,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:23,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:06:23,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:06:23,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:23,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:06:23,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:06:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:06:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:23,578 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 10 states. [2018-11-23 12:06:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,155 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 12:06:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:06:24,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:06:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2018-11-23 12:06:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2018-11-23 12:06:24,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 103 transitions. [2018-11-23 12:06:24,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:24,267 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:06:24,268 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:06:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:06:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-11-23 12:06:24,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:24,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 87 states. [2018-11-23 12:06:24,441 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 87 states. [2018-11-23 12:06:24,441 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 87 states. [2018-11-23 12:06:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,445 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2018-11-23 12:06:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2018-11-23 12:06:24,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,446 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 101 states. [2018-11-23 12:06:24,447 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 101 states. [2018-11-23 12:06:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,450 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2018-11-23 12:06:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2018-11-23 12:06:24,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:24,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:06:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2018-11-23 12:06:24,455 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 51 [2018-11-23 12:06:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:24,455 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2018-11-23 12:06:24,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:06:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2018-11-23 12:06:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:06:24,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:24,457 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:24,457 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:24,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash 854209948, now seen corresponding path program 2 times [2018-11-23 12:06:24,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2253#true} is VALID [2018-11-23 12:06:24,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 12:06:24,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2253#true} {2253#true} #75#return; {2253#true} is VALID [2018-11-23 12:06:24,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {2253#true} call #t~ret6 := main(); {2253#true} is VALID [2018-11-23 12:06:24,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {2253#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {2255#(= main_~a~0 0)} is VALID [2018-11-23 12:06:24,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {2255#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2255#(= main_~a~0 0)} is VALID [2018-11-23 12:06:24,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {2255#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2255#(= main_~a~0 0)} is VALID [2018-11-23 12:06:24,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {2255#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:24,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {2256#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:24,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {2256#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:24,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {2256#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:24,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {2257#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:24,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {2257#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:24,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {2257#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:24,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {2258#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:24,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {2258#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:24,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {2258#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:24,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {2259#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:24,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {2259#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:24,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {2259#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:24,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {2260#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:24,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {2260#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:24,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {2260#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:24,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {2261#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:24,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {2261#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:24,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {2261#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {2262#(<= main_~a~0 7)} is VALID [2018-11-23 12:06:24,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {2262#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2254#false} is VALID [2018-11-23 12:06:24,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {2254#false} ~a~0 := 0; {2254#false} is VALID [2018-11-23 12:06:24,709 INFO L273 TraceCheckUtils]: 29: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:24,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 47: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {2254#false} assume !(#t~mem2 < 0);havoc #t~mem2; {2254#false} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 49: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 50: Hoare triple {2254#false} assume !(~a~0 < 100000); {2254#false} is VALID [2018-11-23 12:06:24,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {2254#false} havoc ~x~0;~x~0 := 0; {2254#false} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {2254#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2254#false} is VALID [2018-11-23 12:06:24,716 INFO L256 TraceCheckUtils]: 53: Hoare triple {2254#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2254#false} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 12:06:24,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 12:06:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 12:06:24,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:24,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:24,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:25,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 12:06:25,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2253#true} is VALID [2018-11-23 12:06:25,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 12:06:25,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2253#true} {2253#true} #75#return; {2253#true} is VALID [2018-11-23 12:06:25,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {2253#true} call #t~ret6 := main(); {2253#true} is VALID [2018-11-23 12:06:25,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {2253#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {2281#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:25,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {2281#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2281#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:25,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2281#(<= main_~a~0 0)} is VALID [2018-11-23 12:06:25,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:25,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {2256#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:25,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {2256#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2256#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:25,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {2256#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:25,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {2257#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:25,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {2257#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2257#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:25,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {2257#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:25,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {2258#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:25,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2258#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2258#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:25,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2258#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:25,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {2259#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:25,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {2259#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2259#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:25,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {2259#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:25,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {2260#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:25,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {2260#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2260#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:25,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {2260#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:25,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {2261#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:25,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {2261#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2261#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:25,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {2261#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {2262#(<= main_~a~0 7)} is VALID [2018-11-23 12:06:25,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {2262#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2254#false} is VALID [2018-11-23 12:06:25,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {2254#false} ~a~0 := 0; {2254#false} is VALID [2018-11-23 12:06:25,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,386 INFO L273 TraceCheckUtils]: 35: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 45: Hoare triple {2254#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 46: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {2254#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 48: Hoare triple {2254#false} assume !(#t~mem2 < 0);havoc #t~mem2; {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {2254#false} ~a~0 := 1 + ~a~0; {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {2254#false} assume !(~a~0 < 100000); {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {2254#false} havoc ~x~0;~x~0 := 0; {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {2254#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L256 TraceCheckUtils]: 53: Hoare triple {2254#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2254#false} is VALID [2018-11-23 12:06:25,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 12:06:25,391 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 12:06:25,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 12:06:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 12:06:25,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:06:25,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-23 12:06:25,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:25,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:25,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:25,459 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand 11 states. [2018-11-23 12:06:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,060 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 12:06:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:26,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-23 12:06:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2018-11-23 12:06:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2018-11-23 12:06:26,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2018-11-23 12:06:26,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,205 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:06:26,205 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:06:26,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:06:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2018-11-23 12:06:26,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:26,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 96 states. [2018-11-23 12:06:26,457 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 96 states. [2018-11-23 12:06:26,457 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 96 states. [2018-11-23 12:06:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,460 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2018-11-23 12:06:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2018-11-23 12:06:26,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,461 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 110 states. [2018-11-23 12:06:26,461 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 110 states. [2018-11-23 12:06:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,464 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2018-11-23 12:06:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2018-11-23 12:06:26,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:26,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:06:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2018-11-23 12:06:26,469 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 57 [2018-11-23 12:06:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:26,469 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2018-11-23 12:06:26,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2018-11-23 12:06:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:06:26,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:26,471 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:26,471 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:26,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1417423670, now seen corresponding path program 3 times [2018-11-23 12:06:26,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {3009#true} call ULTIMATE.init(); {3009#true} is VALID [2018-11-23 12:06:26,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {3009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3009#true} is VALID [2018-11-23 12:06:26,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {3009#true} assume true; {3009#true} is VALID [2018-11-23 12:06:26,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3009#true} {3009#true} #75#return; {3009#true} is VALID [2018-11-23 12:06:26,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {3009#true} call #t~ret6 := main(); {3009#true} is VALID [2018-11-23 12:06:26,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {3009#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {3011#(= main_~a~0 0)} is VALID [2018-11-23 12:06:26,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {3011#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3011#(= main_~a~0 0)} is VALID [2018-11-23 12:06:26,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {3011#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3011#(= main_~a~0 0)} is VALID [2018-11-23 12:06:26,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {3011#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {3012#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:26,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {3012#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3012#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:26,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {3012#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3012#(<= main_~a~0 1)} is VALID [2018-11-23 12:06:26,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {3012#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {3013#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:26,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {3013#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3013#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:26,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {3013#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3013#(<= main_~a~0 2)} is VALID [2018-11-23 12:06:26,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {3013#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {3014#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:26,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {3014#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3014#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:26,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {3014#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3014#(<= main_~a~0 3)} is VALID [2018-11-23 12:06:26,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {3014#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {3015#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:26,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {3015#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3015#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:26,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {3015#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3015#(<= main_~a~0 4)} is VALID [2018-11-23 12:06:26,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {3015#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {3016#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:26,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {3016#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3016#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:26,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {3016#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3016#(<= main_~a~0 5)} is VALID [2018-11-23 12:06:26,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {3016#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {3017#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:26,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {3017#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3017#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:26,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {3017#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3017#(<= main_~a~0 6)} is VALID [2018-11-23 12:06:26,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {3017#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {3018#(<= main_~a~0 7)} is VALID [2018-11-23 12:06:26,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {3018#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3018#(<= main_~a~0 7)} is VALID [2018-11-23 12:06:26,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {3018#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3018#(<= main_~a~0 7)} is VALID [2018-11-23 12:06:26,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {3018#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {3019#(<= main_~a~0 8)} is VALID [2018-11-23 12:06:26,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {3019#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3010#false} is VALID [2018-11-23 12:06:26,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {3010#false} ~a~0 := 0; {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,832 INFO L273 TraceCheckUtils]: 49: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {3010#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3010#false} is VALID [2018-11-23 12:06:26,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,833 INFO L273 TraceCheckUtils]: 53: Hoare triple {3010#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,833 INFO L273 TraceCheckUtils]: 54: Hoare triple {3010#false} assume !(#t~mem2 < 0);havoc #t~mem2; {3010#false} is VALID [2018-11-23 12:06:26,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {3010#false} ~a~0 := 1 + ~a~0; {3010#false} is VALID [2018-11-23 12:06:26,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {3010#false} assume !(~a~0 < 100000); {3010#false} is VALID [2018-11-23 12:06:26,834 INFO L273 TraceCheckUtils]: 57: Hoare triple {3010#false} havoc ~x~0;~x~0 := 0; {3010#false} is VALID [2018-11-23 12:06:26,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {3010#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {3010#false} is VALID [2018-11-23 12:06:26,834 INFO L256 TraceCheckUtils]: 59: Hoare triple {3010#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3010#false} is VALID [2018-11-23 12:06:26,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {3010#false} ~cond := #in~cond; {3010#false} is VALID [2018-11-23 12:06:26,835 INFO L273 TraceCheckUtils]: 61: Hoare triple {3010#false} assume 0 == ~cond; {3010#false} is VALID [2018-11-23 12:06:26,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {3010#false} assume !false; {3010#false} is VALID [2018-11-23 12:06:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:06:26,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:26,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:26,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:26,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:06:26,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:26,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 12:06:26,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:26,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:26,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-23 12:06:26,948 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:26,949 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_14|]. (= 0 (select (store |v_#valid_14| |main_~#aa~0.base| 1) |main_~#bb~0.base|)) [2018-11-23 12:06:26,949 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) [2018-11-23 12:06:27,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 12:06:27,184 INFO L478 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 12:06:27,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:27,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:27,229 INFO L267 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. [2018-11-23 12:06:27,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-11-23 12:06:27,234 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:27,234 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, v_main_~b~0_7]. (let ((.cse0 (select (select |v_#memory_int_10| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 .cse0) (= |#memory_int| (store |v_#memory_int_10| |main_~#bb~0.base| (store (select |v_#memory_int_10| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7)) .cse0))))) [2018-11-23 12:06:27,234 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~b~0_7]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= .cse0 (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7)))) (<= 0 .cse0))) [2018-11-23 12:06:27,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 12:06:27,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 12:06:27,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:06:27,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:27,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 12:06:27,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:99 [2018-11-23 12:06:27,489 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:27,490 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, |main_~#bb~0.base|, v_main_~b~0_8, |main_~#bb~0.offset|, v_main_~b~0_7]. (let ((.cse2 (select |v_#memory_int_11| |main_~#aa~0.base|)) (.cse3 (* 4 main_~a~0))) (let ((.cse0 (select |v_#memory_int_11| |main_~#bb~0.base|)) (.cse1 (select .cse2 (+ |main_~#aa~0.offset| .cse3 (- 4))))) (and (= (select .cse0 (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) .cse1) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= |#memory_int| (store |v_#memory_int_11| |main_~#bb~0.base| (store .cse0 (+ (* 4 v_main_~b~0_8) |main_~#bb~0.offset|) (select .cse2 (+ |main_~#aa~0.offset| .cse3))))) (< main_~a~0 100000) (<= 0 .cse1)))) [2018-11-23 12:06:27,490 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_7, v_main_~b~0_8, v_prenex_1, v_prenex_2, v_prenex_3]. (let ((.cse5 (select |#memory_int| |main_~#aa~0.base|)) (.cse6 (* 4 main_~a~0))) (let ((.cse2 (select .cse5 (+ |main_~#aa~0.offset| .cse6 (- 4))))) (let ((.cse0 (<= 0 .cse2)) (.cse4 (< main_~a~0 100000)) (.cse3 (select .cse5 (+ |main_~#aa~0.offset| .cse6)))) (or (let ((.cse1 (select |#memory_int| |main_~#bb~0.base|))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) .cse0 (= (select .cse1 (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) .cse2) (= (select .cse1 (+ (* 4 v_main_~b~0_8) |main_~#bb~0.offset|)) .cse3) .cse4)) (and (not (= v_prenex_1 |main_~#aa~0.base|)) .cse0 .cse4 (= .cse3 (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))))))))) [2018-11-23 12:06:30,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-23 12:06:30,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:06:30,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 59 [2018-11-23 12:06:30,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-23 12:06:30,165 INFO L478 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 23 treesize of output 17 [2018-11-23 12:06:30,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:30,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:30,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:06:30,204 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2018-11-23 12:06:30,214 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:30,214 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_1, v_prenex_2, v_prenex_3, |main_~#aa~0.base|, v_main_~a~0_32, |main_~#aa~0.offset|]. (let ((.cse1 (* 4 v_main_~a~0_32)) (.cse0 (select |#memory_int| |main_~#aa~0.base|))) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select .cse0 (+ .cse1 |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select .cse0 (+ .cse1 |main_~#aa~0.offset|))) (<= (select .cse0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (< v_main_~a~0_32 100000))) [2018-11-23 12:06:30,214 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (<= main_~a~0 99997) (<= 99999 main_~a~0) (<= 0 |main_#t~mem2|)) [2018-11-23 12:06:30,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {3009#true} call ULTIMATE.init(); {3009#true} is VALID [2018-11-23 12:06:30,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {3009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3009#true} is VALID [2018-11-23 12:06:30,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {3009#true} assume true; {3009#true} is VALID [2018-11-23 12:06:30,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3009#true} {3009#true} #75#return; {3009#true} is VALID [2018-11-23 12:06:30,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {3009#true} call #t~ret6 := main(); {3009#true} is VALID [2018-11-23 12:06:30,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {3009#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:06:30,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {3038#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3096#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:06:30,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {3096#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3100#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:06:30,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {3100#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} ~a~0 := 1 + ~a~0; {3104#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} is VALID [2018-11-23 12:06:30,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {3104#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3108#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))) (< main_~a~0 100000))} is VALID [2018-11-23 12:06:30,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {3108#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_7 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_7))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))) (< main_~a~0 100000))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3112#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_1 |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3)))))) (< main_~a~0 100000))} is VALID [2018-11-23 12:06:30,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_1 |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3)))))) (< main_~a~0 100000))} ~a~0 := 1 + ~a~0; {3116#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (<= main_~a~0 (+ v_main_~a~0_32 1)) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {3116#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (<= main_~a~0 (+ v_main_~a~0_32 1)) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !(~a~0 < 100000); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,419 INFO L273 TraceCheckUtils]: 36: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,420 INFO L273 TraceCheckUtils]: 38: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,439 INFO L273 TraceCheckUtils]: 41: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,444 INFO L273 TraceCheckUtils]: 49: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} ~a~0 := 1 + ~a~0; {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} is VALID [2018-11-23 12:06:30,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {3120#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_main_~a~0_32 Int)) (and (<= 99999 v_main_~a~0_32) (not (= v_prenex_1 |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset| (- 4)))) (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 (* 4 v_prenex_3))) (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_32) |main_~#aa~0.offset|))) (< v_main_~a~0_32 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3181#(or (<= main_~a~0 99997) (<= 99999 main_~a~0) (<= 0 |main_#t~mem2|))} is VALID [2018-11-23 12:06:30,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {3181#(or (<= main_~a~0 99997) (<= 99999 main_~a~0) (<= 0 |main_#t~mem2|))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {3185#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} is VALID [2018-11-23 12:06:30,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {3185#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} ~a~0 := 1 + ~a~0; {3189#(or (<= 100000 main_~a~0) (<= main_~a~0 99998))} is VALID [2018-11-23 12:06:30,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {3189#(or (<= 100000 main_~a~0) (<= main_~a~0 99998))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3193#(<= main_~a~0 99998)} is VALID [2018-11-23 12:06:30,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {3193#(<= main_~a~0 99998)} assume !(#t~mem2 < 0);havoc #t~mem2; {3193#(<= main_~a~0 99998)} is VALID [2018-11-23 12:06:30,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {3193#(<= main_~a~0 99998)} ~a~0 := 1 + ~a~0; {3200#(<= main_~a~0 99999)} is VALID [2018-11-23 12:06:30,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {3200#(<= main_~a~0 99999)} assume !(~a~0 < 100000); {3010#false} is VALID [2018-11-23 12:06:30,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {3010#false} havoc ~x~0;~x~0 := 0; {3010#false} is VALID [2018-11-23 12:06:30,456 INFO L273 TraceCheckUtils]: 58: Hoare triple {3010#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {3010#false} is VALID [2018-11-23 12:06:30,456 INFO L256 TraceCheckUtils]: 59: Hoare triple {3010#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3010#false} is VALID [2018-11-23 12:06:30,457 INFO L273 TraceCheckUtils]: 60: Hoare triple {3010#false} ~cond := #in~cond; {3010#false} is VALID [2018-11-23 12:06:30,457 INFO L273 TraceCheckUtils]: 61: Hoare triple {3010#false} assume 0 == ~cond; {3010#false} is VALID [2018-11-23 12:06:30,457 INFO L273 TraceCheckUtils]: 62: Hoare triple {3010#false} assume !false; {3010#false} is VALID [2018-11-23 12:06:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 25 proven. 57 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-23 12:06:30,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:30,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-11-23 12:06:30,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-11-23 12:06:30,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:30,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:06:30,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:06:30,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:06:30,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:06:30,629 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 24 states. [2018-11-23 12:06:36,182 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-11-23 12:06:47,738 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 12:07:01,680 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 12:07:08,707 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-11-23 12:07:16,021 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 12:07:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:16,469 INFO L93 Difference]: Finished difference Result 322 states and 430 transitions. [2018-11-23 12:07:16,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-11-23 12:07:16,469 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-11-23 12:07:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:07:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 296 transitions. [2018-11-23 12:07:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:07:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 296 transitions. [2018-11-23 12:07:16,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 106 states and 296 transitions. [2018-11-23 12:07:35,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 288 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:35,488 INFO L225 Difference]: With dead ends: 322 [2018-11-23 12:07:35,488 INFO L226 Difference]: Without dead ends: 259 [2018-11-23 12:07:35,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6118 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=2789, Invalid=12710, Unknown=1, NotChecked=0, Total=15500 [2018-11-23 12:07:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-23 12:07:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 175. [2018-11-23 12:07:36,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:36,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 175 states. [2018-11-23 12:07:36,698 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 175 states. [2018-11-23 12:07:36,699 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 175 states. [2018-11-23 12:07:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,709 INFO L93 Difference]: Finished difference Result 259 states and 325 transitions. [2018-11-23 12:07:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 325 transitions. [2018-11-23 12:07:36,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,711 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 259 states. [2018-11-23 12:07:36,711 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 259 states. [2018-11-23 12:07:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:36,721 INFO L93 Difference]: Finished difference Result 259 states and 325 transitions. [2018-11-23 12:07:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 325 transitions. [2018-11-23 12:07:36,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:36,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:36,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:36,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-23 12:07:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 230 transitions. [2018-11-23 12:07:36,729 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 230 transitions. Word has length 63 [2018-11-23 12:07:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:36,729 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 230 transitions. [2018-11-23 12:07:36,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:07:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2018-11-23 12:07:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:07:36,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:36,731 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:36,731 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:36,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1394924172, now seen corresponding path program 4 times [2018-11-23 12:07:36,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:37,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {4620#true} call ULTIMATE.init(); {4620#true} is VALID [2018-11-23 12:07:37,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {4620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4620#true} is VALID [2018-11-23 12:07:37,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {4620#true} assume true; {4620#true} is VALID [2018-11-23 12:07:37,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4620#true} {4620#true} #75#return; {4620#true} is VALID [2018-11-23 12:07:37,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {4620#true} call #t~ret6 := main(); {4620#true} is VALID [2018-11-23 12:07:37,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {4620#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {4622#(= main_~a~0 0)} is VALID [2018-11-23 12:07:37,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {4622#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4622#(= main_~a~0 0)} is VALID [2018-11-23 12:07:37,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {4622#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4622#(= main_~a~0 0)} is VALID [2018-11-23 12:07:37,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {4622#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:37,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {4623#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:37,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {4623#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:37,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {4623#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:37,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {4624#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:37,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {4624#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:37,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {4624#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:37,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {4625#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:37,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {4625#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:37,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {4625#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:37,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {4626#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:37,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {4626#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:37,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {4626#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:37,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {4627#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:37,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {4627#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:37,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {4627#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:37,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {4628#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:37,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {4628#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:37,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {4628#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:37,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {4629#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:37,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {4629#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:37,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {4629#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:37,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {4630#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:37,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {4630#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:37,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {4630#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:37,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {4631#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:37,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {4631#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:37,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {4631#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:37,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {4632#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:37,389 INFO L273 TraceCheckUtils]: 37: Hoare triple {4632#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:37,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {4632#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:37,390 INFO L273 TraceCheckUtils]: 39: Hoare triple {4633#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:37,391 INFO L273 TraceCheckUtils]: 40: Hoare triple {4633#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:37,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {4633#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {4634#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:37,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {4634#(<= main_~a~0 12)} assume !(~a~0 < 100000); {4621#false} is VALID [2018-11-23 12:07:37,393 INFO L273 TraceCheckUtils]: 43: Hoare triple {4621#false} ~a~0 := 0; {4621#false} is VALID [2018-11-23 12:07:37,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,393 INFO L273 TraceCheckUtils]: 45: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,394 INFO L273 TraceCheckUtils]: 51: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,394 INFO L273 TraceCheckUtils]: 52: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,395 INFO L273 TraceCheckUtils]: 54: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,395 INFO L273 TraceCheckUtils]: 55: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,396 INFO L273 TraceCheckUtils]: 57: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,396 INFO L273 TraceCheckUtils]: 61: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,397 INFO L273 TraceCheckUtils]: 62: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,397 INFO L273 TraceCheckUtils]: 63: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,397 INFO L273 TraceCheckUtils]: 64: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,397 INFO L273 TraceCheckUtils]: 65: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,397 INFO L273 TraceCheckUtils]: 66: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,398 INFO L273 TraceCheckUtils]: 67: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,398 INFO L273 TraceCheckUtils]: 68: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,398 INFO L273 TraceCheckUtils]: 69: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,398 INFO L273 TraceCheckUtils]: 70: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 71: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 72: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 73: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 74: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 75: Hoare triple {4621#false} assume !(#t~mem2 < 0);havoc #t~mem2; {4621#false} is VALID [2018-11-23 12:07:37,399 INFO L273 TraceCheckUtils]: 76: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 77: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 78: Hoare triple {4621#false} assume !(#t~mem2 < 0);havoc #t~mem2; {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 79: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 80: Hoare triple {4621#false} assume !(~a~0 < 100000); {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 81: Hoare triple {4621#false} havoc ~x~0;~x~0 := 0; {4621#false} is VALID [2018-11-23 12:07:37,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {4621#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4621#false} is VALID [2018-11-23 12:07:37,401 INFO L256 TraceCheckUtils]: 83: Hoare triple {4621#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4621#false} is VALID [2018-11-23 12:07:37,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {4621#false} ~cond := #in~cond; {4621#false} is VALID [2018-11-23 12:07:37,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {4621#false} assume 0 == ~cond; {4621#false} is VALID [2018-11-23 12:07:37,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {4621#false} assume !false; {4621#false} is VALID [2018-11-23 12:07:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:07:37,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:37,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:37,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:37,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:37,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:37,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:38,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {4620#true} call ULTIMATE.init(); {4620#true} is VALID [2018-11-23 12:07:38,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {4620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4620#true} is VALID [2018-11-23 12:07:38,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {4620#true} assume true; {4620#true} is VALID [2018-11-23 12:07:38,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4620#true} {4620#true} #75#return; {4620#true} is VALID [2018-11-23 12:07:38,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {4620#true} call #t~ret6 := main(); {4620#true} is VALID [2018-11-23 12:07:38,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {4620#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {4653#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:38,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {4653#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4653#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:38,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {4653#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4653#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:38,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {4653#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:38,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {4623#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:38,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {4623#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4623#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:38,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {4623#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:38,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {4624#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:38,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {4624#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4624#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:38,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {4624#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:38,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {4625#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:38,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {4625#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4625#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:38,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {4625#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:38,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {4626#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:38,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {4626#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4626#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:38,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {4626#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:38,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {4627#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:38,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {4627#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4627#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:38,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {4627#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:38,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {4628#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:38,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {4628#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4628#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:38,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {4628#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:38,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {4629#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:38,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {4629#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4629#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:38,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {4629#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:38,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {4630#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:38,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {4630#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4630#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:38,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {4630#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:38,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {4631#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:38,115 INFO L273 TraceCheckUtils]: 34: Hoare triple {4631#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4631#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:38,115 INFO L273 TraceCheckUtils]: 35: Hoare triple {4631#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:38,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {4632#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:38,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {4632#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4632#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:38,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {4632#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:38,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {4633#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:38,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {4633#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4633#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:38,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {4633#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {4634#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:38,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {4634#(<= main_~a~0 12)} assume !(~a~0 < 100000); {4621#false} is VALID [2018-11-23 12:07:38,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {4621#false} ~a~0 := 0; {4621#false} is VALID [2018-11-23 12:07:38,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 50: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 64: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 65: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 66: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {4621#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {4621#false} assume !(#t~mem2 < 0);havoc #t~mem2; {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 76: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 77: Hoare triple {4621#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 78: Hoare triple {4621#false} assume !(#t~mem2 < 0);havoc #t~mem2; {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {4621#false} ~a~0 := 1 + ~a~0; {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {4621#false} assume !(~a~0 < 100000); {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 81: Hoare triple {4621#false} havoc ~x~0;~x~0 := 0; {4621#false} is VALID [2018-11-23 12:07:38,140 INFO L273 TraceCheckUtils]: 82: Hoare triple {4621#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4621#false} is VALID [2018-11-23 12:07:38,141 INFO L256 TraceCheckUtils]: 83: Hoare triple {4621#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4621#false} is VALID [2018-11-23 12:07:38,141 INFO L273 TraceCheckUtils]: 84: Hoare triple {4621#false} ~cond := #in~cond; {4621#false} is VALID [2018-11-23 12:07:38,141 INFO L273 TraceCheckUtils]: 85: Hoare triple {4621#false} assume 0 == ~cond; {4621#false} is VALID [2018-11-23 12:07:38,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {4621#false} assume !false; {4621#false} is VALID [2018-11-23 12:07:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:07:38,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:38,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:07:38,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-11-23 12:07:38,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:38,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:07:38,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:38,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:07:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:07:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:07:38,222 INFO L87 Difference]: Start difference. First operand 175 states and 230 transitions. Second operand 16 states. [2018-11-23 12:07:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:39,503 INFO L93 Difference]: Finished difference Result 348 states and 461 transitions. [2018-11-23 12:07:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:07:39,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-11-23 12:07:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:07:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2018-11-23 12:07:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:07:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2018-11-23 12:07:39,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 151 transitions. [2018-11-23 12:07:39,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:39,682 INFO L225 Difference]: With dead ends: 348 [2018-11-23 12:07:39,682 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 12:07:39,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:07:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 12:07:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2018-11-23 12:07:40,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:40,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 187 states. [2018-11-23 12:07:40,481 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 187 states. [2018-11-23 12:07:40,481 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 187 states. [2018-11-23 12:07:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:40,489 INFO L93 Difference]: Finished difference Result 223 states and 291 transitions. [2018-11-23 12:07:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 291 transitions. [2018-11-23 12:07:40,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:40,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:40,490 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 223 states. [2018-11-23 12:07:40,490 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 223 states. [2018-11-23 12:07:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:40,498 INFO L93 Difference]: Finished difference Result 223 states and 291 transitions. [2018-11-23 12:07:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 291 transitions. [2018-11-23 12:07:40,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:40,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:40,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:40,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-23 12:07:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2018-11-23 12:07:40,515 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 87 [2018-11-23 12:07:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:40,515 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2018-11-23 12:07:40,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:07:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2018-11-23 12:07:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:07:40,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:40,517 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:40,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:40,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -308723174, now seen corresponding path program 5 times [2018-11-23 12:07:40,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:40,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:40,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:41,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-23 12:07:41,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6060#true} is VALID [2018-11-23 12:07:41,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-23 12:07:41,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #75#return; {6060#true} is VALID [2018-11-23 12:07:41,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret6 := main(); {6060#true} is VALID [2018-11-23 12:07:41,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {6062#(= main_~a~0 0)} is VALID [2018-11-23 12:07:41,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {6062#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6062#(= main_~a~0 0)} is VALID [2018-11-23 12:07:41,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {6062#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6062#(= main_~a~0 0)} is VALID [2018-11-23 12:07:41,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {6062#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {6063#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {6063#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {6063#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {6064#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {6064#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {6064#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {6065#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {6065#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {6065#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {6066#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {6066#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {6066#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {6067#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {6067#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {6067#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {6068#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {6068#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {6068#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {6069#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {6069#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {6069#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {6070#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {6070#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {6070#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,194 INFO L273 TraceCheckUtils]: 33: Hoare triple {6071#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {6071#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {6071#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {6072#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {6072#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,197 INFO L273 TraceCheckUtils]: 38: Hoare triple {6072#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {6073#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {6073#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,199 INFO L273 TraceCheckUtils]: 41: Hoare triple {6073#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,200 INFO L273 TraceCheckUtils]: 42: Hoare triple {6074#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,200 INFO L273 TraceCheckUtils]: 43: Hoare triple {6074#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,201 INFO L273 TraceCheckUtils]: 44: Hoare triple {6074#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {6075#(<= main_~a~0 13)} is VALID [2018-11-23 12:07:41,202 INFO L273 TraceCheckUtils]: 45: Hoare triple {6075#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6061#false} is VALID [2018-11-23 12:07:41,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#false} ~a~0 := 0; {6061#false} is VALID [2018-11-23 12:07:41,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,202 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,203 INFO L273 TraceCheckUtils]: 51: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,203 INFO L273 TraceCheckUtils]: 52: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 60: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 63: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,205 INFO L273 TraceCheckUtils]: 65: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 66: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 67: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 68: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 69: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 70: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 71: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,206 INFO L273 TraceCheckUtils]: 72: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,207 INFO L273 TraceCheckUtils]: 73: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,207 INFO L273 TraceCheckUtils]: 74: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,207 INFO L273 TraceCheckUtils]: 75: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,207 INFO L273 TraceCheckUtils]: 76: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,207 INFO L273 TraceCheckUtils]: 77: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 78: Hoare triple {6061#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 79: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 80: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 81: Hoare triple {6061#false} assume !(#t~mem2 < 0);havoc #t~mem2; {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,208 INFO L273 TraceCheckUtils]: 83: Hoare triple {6061#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,209 INFO L273 TraceCheckUtils]: 84: Hoare triple {6061#false} assume !(#t~mem2 < 0);havoc #t~mem2; {6061#false} is VALID [2018-11-23 12:07:41,209 INFO L273 TraceCheckUtils]: 85: Hoare triple {6061#false} ~a~0 := 1 + ~a~0; {6061#false} is VALID [2018-11-23 12:07:41,209 INFO L273 TraceCheckUtils]: 86: Hoare triple {6061#false} assume !(~a~0 < 100000); {6061#false} is VALID [2018-11-23 12:07:41,209 INFO L273 TraceCheckUtils]: 87: Hoare triple {6061#false} havoc ~x~0;~x~0 := 0; {6061#false} is VALID [2018-11-23 12:07:41,209 INFO L273 TraceCheckUtils]: 88: Hoare triple {6061#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,210 INFO L256 TraceCheckUtils]: 89: Hoare triple {6061#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6061#false} is VALID [2018-11-23 12:07:41,210 INFO L273 TraceCheckUtils]: 90: Hoare triple {6061#false} ~cond := #in~cond; {6061#false} is VALID [2018-11-23 12:07:41,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {6061#false} assume 0 == ~cond; {6061#false} is VALID [2018-11-23 12:07:41,210 INFO L273 TraceCheckUtils]: 92: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-23 12:07:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-23 12:07:41,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:41,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:41,238 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:41,411 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-23 12:07:41,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:41,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:41,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-23 12:07:41,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6060#true} is VALID [2018-11-23 12:07:41,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-23 12:07:41,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #75#return; {6060#true} is VALID [2018-11-23 12:07:41,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret6 := main(); {6060#true} is VALID [2018-11-23 12:07:41,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {6060#true} is VALID [2018-11-23 12:07:41,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 37: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 38: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,670 INFO L273 TraceCheckUtils]: 41: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {6060#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6060#true} is VALID [2018-11-23 12:07:41,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {6060#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6060#true} is VALID [2018-11-23 12:07:41,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {6060#true} ~a~0 := 1 + ~a~0; {6060#true} is VALID [2018-11-23 12:07:41,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {6060#true} assume !(~a~0 < 100000); {6060#true} is VALID [2018-11-23 12:07:41,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {6060#true} ~a~0 := 0; {6217#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:41,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {6217#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6217#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:41,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {6217#(<= main_~a~0 0)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6217#(<= main_~a~0 0)} is VALID [2018-11-23 12:07:41,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {6217#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {6063#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,673 INFO L273 TraceCheckUtils]: 51: Hoare triple {6063#(<= main_~a~0 1)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6063#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:41,674 INFO L273 TraceCheckUtils]: 52: Hoare triple {6063#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,674 INFO L273 TraceCheckUtils]: 53: Hoare triple {6064#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,675 INFO L273 TraceCheckUtils]: 54: Hoare triple {6064#(<= main_~a~0 2)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6064#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:41,676 INFO L273 TraceCheckUtils]: 55: Hoare triple {6064#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,676 INFO L273 TraceCheckUtils]: 56: Hoare triple {6065#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {6065#(<= main_~a~0 3)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6065#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:41,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {6065#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {6066#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {6066#(<= main_~a~0 4)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6066#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:41,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {6066#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {6067#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,680 INFO L273 TraceCheckUtils]: 63: Hoare triple {6067#(<= main_~a~0 5)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6067#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:41,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {6067#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {6068#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,682 INFO L273 TraceCheckUtils]: 66: Hoare triple {6068#(<= main_~a~0 6)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6068#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:41,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {6068#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {6069#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {6069#(<= main_~a~0 7)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6069#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:41,685 INFO L273 TraceCheckUtils]: 70: Hoare triple {6069#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,685 INFO L273 TraceCheckUtils]: 71: Hoare triple {6070#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {6070#(<= main_~a~0 8)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6070#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:41,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {6070#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,687 INFO L273 TraceCheckUtils]: 74: Hoare triple {6071#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,688 INFO L273 TraceCheckUtils]: 75: Hoare triple {6071#(<= main_~a~0 9)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6071#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:41,689 INFO L273 TraceCheckUtils]: 76: Hoare triple {6071#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,689 INFO L273 TraceCheckUtils]: 77: Hoare triple {6072#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,690 INFO L273 TraceCheckUtils]: 78: Hoare triple {6072#(<= main_~a~0 10)} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {6072#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:41,690 INFO L273 TraceCheckUtils]: 79: Hoare triple {6072#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {6073#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,692 INFO L273 TraceCheckUtils]: 81: Hoare triple {6073#(<= main_~a~0 11)} assume !(#t~mem2 < 0);havoc #t~mem2; {6073#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:41,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {6073#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {6074#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {6074#(<= main_~a~0 12)} assume !(#t~mem2 < 0);havoc #t~mem2; {6074#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:41,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {6074#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {6075#(<= main_~a~0 13)} is VALID [2018-11-23 12:07:41,695 INFO L273 TraceCheckUtils]: 86: Hoare triple {6075#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6061#false} is VALID [2018-11-23 12:07:41,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {6061#false} havoc ~x~0;~x~0 := 0; {6061#false} is VALID [2018-11-23 12:07:41,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {6061#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {6061#false} is VALID [2018-11-23 12:07:41,695 INFO L256 TraceCheckUtils]: 89: Hoare triple {6061#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6061#false} is VALID [2018-11-23 12:07:41,696 INFO L273 TraceCheckUtils]: 90: Hoare triple {6061#false} ~cond := #in~cond; {6061#false} is VALID [2018-11-23 12:07:41,696 INFO L273 TraceCheckUtils]: 91: Hoare triple {6061#false} assume 0 == ~cond; {6061#false} is VALID [2018-11-23 12:07:41,696 INFO L273 TraceCheckUtils]: 92: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-23 12:07:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-23 12:07:41,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:41,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:07:41,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 12:07:41,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:41,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:07:41,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:41,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:07:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:07:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:07:41,838 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. Second operand 17 states. [2018-11-23 12:07:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:44,798 INFO L93 Difference]: Finished difference Result 369 states and 489 transitions. [2018-11-23 12:07:44,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:07:44,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 12:07:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:07:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 12:07:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:07:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 12:07:44,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 159 transitions. [2018-11-23 12:07:45,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:45,013 INFO L225 Difference]: With dead ends: 369 [2018-11-23 12:07:45,013 INFO L226 Difference]: Without dead ends: 235 [2018-11-23 12:07:45,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:07:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-23 12:07:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 199. [2018-11-23 12:07:45,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:45,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 199 states. [2018-11-23 12:07:45,857 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 199 states. [2018-11-23 12:07:45,857 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 199 states. [2018-11-23 12:07:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,865 INFO L93 Difference]: Finished difference Result 235 states and 307 transitions. [2018-11-23 12:07:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 307 transitions. [2018-11-23 12:07:45,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,866 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 235 states. [2018-11-23 12:07:45,866 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 235 states. [2018-11-23 12:07:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:45,872 INFO L93 Difference]: Finished difference Result 235 states and 307 transitions. [2018-11-23 12:07:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 307 transitions. [2018-11-23 12:07:45,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:45,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:45,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:45,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 12:07:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 262 transitions. [2018-11-23 12:07:45,878 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 262 transitions. Word has length 93 [2018-11-23 12:07:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:45,879 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 262 transitions. [2018-11-23 12:07:45,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:07:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2018-11-23 12:07:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:07:45,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:45,881 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:45,881 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:45,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1668158772, now seen corresponding path program 6 times [2018-11-23 12:07:45,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {7587#true} call ULTIMATE.init(); {7587#true} is VALID [2018-11-23 12:07:46,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {7587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7587#true} is VALID [2018-11-23 12:07:46,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {7587#true} assume true; {7587#true} is VALID [2018-11-23 12:07:46,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7587#true} {7587#true} #75#return; {7587#true} is VALID [2018-11-23 12:07:46,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {7587#true} call #t~ret6 := main(); {7587#true} is VALID [2018-11-23 12:07:46,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {7587#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {7589#(= main_~a~0 0)} is VALID [2018-11-23 12:07:46,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {7589#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7589#(= main_~a~0 0)} is VALID [2018-11-23 12:07:46,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {7589#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7589#(= main_~a~0 0)} is VALID [2018-11-23 12:07:46,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {7589#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {7590#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:46,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {7590#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7590#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:46,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {7590#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7590#(<= main_~a~0 1)} is VALID [2018-11-23 12:07:46,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {7590#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {7591#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:46,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {7591#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7591#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:46,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {7591#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7591#(<= main_~a~0 2)} is VALID [2018-11-23 12:07:46,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {7591#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {7592#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:46,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {7592#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7592#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:46,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {7592#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7592#(<= main_~a~0 3)} is VALID [2018-11-23 12:07:46,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {7592#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {7593#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:46,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {7593#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7593#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:46,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {7593#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7593#(<= main_~a~0 4)} is VALID [2018-11-23 12:07:46,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {7593#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {7594#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:46,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {7594#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7594#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:46,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {7594#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7594#(<= main_~a~0 5)} is VALID [2018-11-23 12:07:46,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {7594#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {7595#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:46,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {7595#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7595#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:46,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {7595#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7595#(<= main_~a~0 6)} is VALID [2018-11-23 12:07:46,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {7595#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {7596#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:46,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {7596#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7596#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:46,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {7596#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7596#(<= main_~a~0 7)} is VALID [2018-11-23 12:07:46,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {7596#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {7597#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:46,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {7597#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7597#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:46,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {7597#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7597#(<= main_~a~0 8)} is VALID [2018-11-23 12:07:46,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {7597#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {7598#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:46,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {7598#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7598#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:46,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {7598#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7598#(<= main_~a~0 9)} is VALID [2018-11-23 12:07:46,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {7598#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {7599#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:46,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {7599#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7599#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:46,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {7599#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7599#(<= main_~a~0 10)} is VALID [2018-11-23 12:07:46,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {7599#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {7600#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:46,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {7600#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7600#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:46,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {7600#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7600#(<= main_~a~0 11)} is VALID [2018-11-23 12:07:46,210 INFO L273 TraceCheckUtils]: 41: Hoare triple {7600#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {7601#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:46,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {7601#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7601#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:46,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {7601#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7601#(<= main_~a~0 12)} is VALID [2018-11-23 12:07:46,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {7601#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {7602#(<= main_~a~0 13)} is VALID [2018-11-23 12:07:46,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {7602#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7602#(<= main_~a~0 13)} is VALID [2018-11-23 12:07:46,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {7602#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7602#(<= main_~a~0 13)} is VALID [2018-11-23 12:07:46,214 INFO L273 TraceCheckUtils]: 47: Hoare triple {7602#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {7603#(<= main_~a~0 14)} is VALID [2018-11-23 12:07:46,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {7603#(<= main_~a~0 14)} assume !(~a~0 < 100000); {7588#false} is VALID [2018-11-23 12:07:46,215 INFO L273 TraceCheckUtils]: 49: Hoare triple {7588#false} ~a~0 := 0; {7588#false} is VALID [2018-11-23 12:07:46,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,215 INFO L273 TraceCheckUtils]: 51: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,215 INFO L273 TraceCheckUtils]: 52: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,215 INFO L273 TraceCheckUtils]: 53: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,216 INFO L273 TraceCheckUtils]: 54: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,216 INFO L273 TraceCheckUtils]: 55: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,217 INFO L273 TraceCheckUtils]: 59: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,217 INFO L273 TraceCheckUtils]: 60: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,217 INFO L273 TraceCheckUtils]: 61: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,217 INFO L273 TraceCheckUtils]: 62: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,217 INFO L273 TraceCheckUtils]: 63: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,218 INFO L273 TraceCheckUtils]: 64: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,218 INFO L273 TraceCheckUtils]: 65: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,218 INFO L273 TraceCheckUtils]: 66: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,218 INFO L273 TraceCheckUtils]: 67: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,218 INFO L273 TraceCheckUtils]: 68: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 69: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 70: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 71: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 72: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 73: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 75: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,219 INFO L273 TraceCheckUtils]: 76: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 77: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 78: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 79: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 80: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 81: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 82: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 83: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,220 INFO L273 TraceCheckUtils]: 84: Hoare triple {7588#false} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 85: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 86: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 87: Hoare triple {7588#false} assume !(#t~mem2 < 0);havoc #t~mem2; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 88: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 89: Hoare triple {7588#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 90: Hoare triple {7588#false} assume !(#t~mem2 < 0);havoc #t~mem2; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 91: Hoare triple {7588#false} ~a~0 := 1 + ~a~0; {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 92: Hoare triple {7588#false} assume !(~a~0 < 100000); {7588#false} is VALID [2018-11-23 12:07:46,221 INFO L273 TraceCheckUtils]: 93: Hoare triple {7588#false} havoc ~x~0;~x~0 := 0; {7588#false} is VALID [2018-11-23 12:07:46,222 INFO L273 TraceCheckUtils]: 94: Hoare triple {7588#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {7588#false} is VALID [2018-11-23 12:07:46,222 INFO L256 TraceCheckUtils]: 95: Hoare triple {7588#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7588#false} is VALID [2018-11-23 12:07:46,222 INFO L273 TraceCheckUtils]: 96: Hoare triple {7588#false} ~cond := #in~cond; {7588#false} is VALID [2018-11-23 12:07:46,222 INFO L273 TraceCheckUtils]: 97: Hoare triple {7588#false} assume 0 == ~cond; {7588#false} is VALID [2018-11-23 12:07:46,222 INFO L273 TraceCheckUtils]: 98: Hoare triple {7588#false} assume !false; {7588#false} is VALID [2018-11-23 12:07:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-11-23 12:07:46,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:46,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:46,452 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:07:46,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:46,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 12:07:46,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:07:46,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:07:46,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-23 12:07:46,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:07:46,511 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= (select (store |v_#valid_15| |main_~#aa~0.base| 1) |main_~#bb~0.base|) 0) [2018-11-23 12:07:46,512 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) [2018-11-23 12:07:46,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 12:07:46,693 INFO L478 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 12:07:46,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:07:46,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:07:46,713 INFO L267 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. [2018-11-23 12:07:46,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-11-23 12:07:46,718 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:07:46,718 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, v_main_~b~0_9]. (let ((.cse0 (select (select |v_#memory_int_12| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= |#memory_int| (store |v_#memory_int_12| |main_~#bb~0.base| (store (select |v_#memory_int_12| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|) .cse0))) (<= 0 .cse0))) [2018-11-23 12:07:46,719 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~b~0_9]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) .cse0) (<= 0 .cse0))) [2018-11-23 12:07:46,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 12:07:46,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 12:07:46,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:07:46,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:07:46,918 INFO L267 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. [2018-11-23 12:07:46,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:93 [2018-11-23 12:07:46,924 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:07:46,924 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, v_main_~b~0_10, v_main_~b~0_9]. (let ((.cse2 (select |v_#memory_int_13| |main_~#aa~0.base|)) (.cse3 (* 4 main_~a~0))) (let ((.cse0 (select .cse2 (+ |main_~#aa~0.offset| .cse3 (- 4)))) (.cse1 (select |v_#memory_int_13| |main_~#bb~0.base|))) (and (<= 0 .cse0) (= .cse0 (select .cse1 (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= |#memory_int| (store |v_#memory_int_13| |main_~#bb~0.base| (store .cse1 (+ (* 4 v_main_~b~0_10) |main_~#bb~0.offset|) (select .cse2 (+ |main_~#aa~0.offset| .cse3)))))))) [2018-11-23 12:07:46,924 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, v_main_~b~0_10, v_main_~b~0_9]. (let ((.cse5 (select |#memory_int| |main_~#aa~0.base|)) (.cse6 (* 4 main_~a~0))) (let ((.cse3 (select .cse5 (+ |main_~#aa~0.offset| .cse6 (- 4))))) (let ((.cse0 (not (= |main_~#bb~0.base| |main_~#aa~0.base|))) (.cse2 (select |#memory_int| |main_~#bb~0.base|)) (.cse4 (select .cse5 (+ |main_~#aa~0.offset| .cse6))) (.cse1 (<= 0 .cse3))) (or (and .cse0 .cse1 (= (select .cse2 (+ (* 4 v_prenex_4) |main_~#bb~0.offset|)) .cse3) (= .cse4 (select .cse2 (+ (* 4 v_main_~b~0_10) |main_~#bb~0.offset|)))) (and .cse0 (= (select .cse2 (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) .cse4) .cse1))))) [2018-11-23 12:07:47,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 12:07:47,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 12:07:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:07:47,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:07:47,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 12:07:47,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:99 [2018-11-23 12:07:47,222 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:07:47,222 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, |main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_11, v_main_~b~0_9]. (let ((.cse0 (select |v_#memory_int_14| |main_~#bb~0.base|)) (.cse1 (select |v_#memory_int_14| |main_~#aa~0.base|)) (.cse2 (* 4 main_~a~0))) (and (= (store |v_#memory_int_14| |main_~#bb~0.base| (store .cse0 (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11)) (select .cse1 (+ |main_~#aa~0.offset| .cse2)))) |#memory_int|) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select .cse0 (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select .cse1 (+ |main_~#aa~0.offset| .cse2 (- 4)))) (< main_~a~0 100000) (<= 0 (select .cse1 (+ |main_~#aa~0.offset| .cse2 (- 8)))))) [2018-11-23 12:07:47,222 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_5, v_main_~b~0_9, v_prenex_6, v_prenex_7, |main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_11]. (let ((.cse4 (select |#memory_int| |main_~#aa~0.base|)) (.cse5 (* 4 main_~a~0))) (let ((.cse0 (<= 0 (select .cse4 (+ |main_~#aa~0.offset| .cse5 (- 8))))) (.cse1 (< main_~a~0 100000)) (.cse2 (select .cse4 (+ |main_~#aa~0.offset| .cse5)))) (or (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) .cse0 .cse1 (= .cse2 (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))))) (let ((.cse3 (select |#memory_int| v_prenex_5))) (and (not (= v_prenex_5 |main_~#aa~0.base|)) .cse0 (= (select .cse3 (+ (* 4 v_main_~b~0_9) v_prenex_6)) (select .cse4 (+ |main_~#aa~0.offset| .cse5 (- 4)))) .cse1 (= .cse2 (select .cse3 (+ v_prenex_6 (* 4 v_prenex_7))))))))) [2018-11-23 12:07:48,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-23 12:07:48,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:07:48,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 59 [2018-11-23 12:07:48,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-23 12:07:48,382 INFO L478 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 23 treesize of output 17 [2018-11-23 12:07:48,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:07:48,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:07:48,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:07:48,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2018-11-23 12:07:48,425 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:07:48,425 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#bb~0.base|, |main_~#bb~0.offset|, v_main_~b~0_11, |main_~#aa~0.base|, |main_~#aa~0.offset|, v_main_~a~0_62]. (let ((.cse1 (* 4 v_main_~a~0_62)) (.cse0 (select |#memory_int| |main_~#aa~0.base|))) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select .cse0 (+ |main_~#aa~0.offset| .cse1))) (<= 0 (select .cse0 (+ |main_~#aa~0.offset| .cse1 (- 8)))) (<= 99999 v_main_~a~0_62) (<= (select .cse0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (< v_main_~a~0_62 100000))) [2018-11-23 12:07:48,425 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (<= 99998 main_~a~0) (<= main_~a~0 99996) (<= 0 |main_#t~mem2|)) [2018-11-23 12:07:48,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {7587#true} call ULTIMATE.init(); {7587#true} is VALID [2018-11-23 12:07:48,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {7587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7587#true} is VALID [2018-11-23 12:07:48,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {7587#true} assume true; {7587#true} is VALID [2018-11-23 12:07:48,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7587#true} {7587#true} #75#return; {7587#true} is VALID [2018-11-23 12:07:48,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {7587#true} call #t~ret6 := main(); {7587#true} is VALID [2018-11-23 12:07:48,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {7587#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);havoc ~cc~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} ~a~0 := 1 + ~a~0; {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} is VALID [2018-11-23 12:07:48,651 INFO L273 TraceCheckUtils]: 39: Hoare triple {7622#(not (= |main_~#bb~0.base| |main_~#aa~0.base|))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7725#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:07:48,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {7725#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7729#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:07:48,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {7729#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} ~a~0 := 1 + ~a~0; {7733#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} is VALID [2018-11-23 12:07:48,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {7733#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7733#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} is VALID [2018-11-23 12:07:48,659 INFO L273 TraceCheckUtils]: 43: Hoare triple {7733#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7740#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} is VALID [2018-11-23 12:07:48,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {7740#(and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4)))))} ~a~0 := 1 + ~a~0; {7744#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))))} is VALID [2018-11-23 12:07:48,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {7744#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))))} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7748#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))) (< main_~a~0 100000))} is VALID [2018-11-23 12:07:48,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {7748#(and (exists ((v_main_~b~0_9 Int)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 v_main_~b~0_9) |main_~#bb~0.offset|)) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 4))))) (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))) (< main_~a~0 100000))} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7752#(and (exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11)))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))) (< main_~a~0 100000))} is VALID [2018-11-23 12:07:48,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {7752#(and (exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11)))))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0) (- 8)))) (< main_~a~0 100000))} ~a~0 := 1 + ~a~0; {7756#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= main_~a~0 (+ v_main_~a~0_62 1)) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {7756#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= main_~a~0 (+ v_main_~a~0_62 1)) (< v_main_~a~0_62 100000)))} assume !(~a~0 < 100000); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,678 INFO L273 TraceCheckUtils]: 51: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,679 INFO L273 TraceCheckUtils]: 53: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,680 INFO L273 TraceCheckUtils]: 57: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,680 INFO L273 TraceCheckUtils]: 58: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,681 INFO L273 TraceCheckUtils]: 59: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,681 INFO L273 TraceCheckUtils]: 60: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,682 INFO L273 TraceCheckUtils]: 61: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,682 INFO L273 TraceCheckUtils]: 62: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,684 INFO L273 TraceCheckUtils]: 65: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,685 INFO L273 TraceCheckUtils]: 66: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,685 INFO L273 TraceCheckUtils]: 67: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,686 INFO L273 TraceCheckUtils]: 68: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,686 INFO L273 TraceCheckUtils]: 69: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,687 INFO L273 TraceCheckUtils]: 70: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,687 INFO L273 TraceCheckUtils]: 71: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,688 INFO L273 TraceCheckUtils]: 72: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,689 INFO L273 TraceCheckUtils]: 73: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,689 INFO L273 TraceCheckUtils]: 74: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,692 INFO L273 TraceCheckUtils]: 79: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,693 INFO L273 TraceCheckUtils]: 81: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} ~a~0 := 1 + ~a~0; {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} is VALID [2018-11-23 12:07:48,695 INFO L273 TraceCheckUtils]: 83: Hoare triple {7760#(exists ((|main_~#bb~0.base| Int) (|main_~#bb~0.offset| Int) (v_main_~b~0_11 Int) (v_main_~a~0_62 Int)) (and (not (= |main_~#bb~0.base| |main_~#aa~0.base|)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ |main_~#bb~0.offset| (* 4 v_main_~b~0_11))) (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62)))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_62) (- 8)))) (<= 99999 v_main_~a~0_62) (< v_main_~a~0_62 100000)))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7866#(or (<= 99998 main_~a~0) (<= main_~a~0 99996) (<= 0 |main_#t~mem2|))} is VALID [2018-11-23 12:07:48,696 INFO L273 TraceCheckUtils]: 84: Hoare triple {7866#(or (<= 99998 main_~a~0) (<= main_~a~0 99996) (<= 0 |main_#t~mem2|))} assume #t~mem2 < 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);~cc~0 := ~cc~0[~c~0 := #t~mem3];havoc #t~mem3;~c~0 := 1 + ~c~0; {7870#(or (<= 99998 main_~a~0) (<= main_~a~0 99996))} is VALID [2018-11-23 12:07:48,697 INFO L273 TraceCheckUtils]: 85: Hoare triple {7870#(or (<= 99998 main_~a~0) (<= main_~a~0 99996))} ~a~0 := 1 + ~a~0; {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} is VALID [2018-11-23 12:07:48,698 INFO L273 TraceCheckUtils]: 86: Hoare triple {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} is VALID [2018-11-23 12:07:48,698 INFO L273 TraceCheckUtils]: 87: Hoare triple {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} assume !(#t~mem2 < 0);havoc #t~mem2; {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} is VALID [2018-11-23 12:07:48,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {7874#(or (<= main_~a~0 99997) (<= 99999 main_~a~0))} ~a~0 := 1 + ~a~0; {7884#(or (<= 100000 main_~a~0) (<= main_~a~0 99998))} is VALID [2018-11-23 12:07:48,700 INFO L273 TraceCheckUtils]: 89: Hoare triple {7884#(or (<= 100000 main_~a~0) (<= main_~a~0 99998))} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7888#(<= main_~a~0 99998)} is VALID [2018-11-23 12:07:48,700 INFO L273 TraceCheckUtils]: 90: Hoare triple {7888#(<= main_~a~0 99998)} assume !(#t~mem2 < 0);havoc #t~mem2; {7888#(<= main_~a~0 99998)} is VALID [2018-11-23 12:07:48,701 INFO L273 TraceCheckUtils]: 91: Hoare triple {7888#(<= main_~a~0 99998)} ~a~0 := 1 + ~a~0; {7895#(<= main_~a~0 99999)} is VALID [2018-11-23 12:07:48,702 INFO L273 TraceCheckUtils]: 92: Hoare triple {7895#(<= main_~a~0 99999)} assume !(~a~0 < 100000); {7588#false} is VALID [2018-11-23 12:07:48,702 INFO L273 TraceCheckUtils]: 93: Hoare triple {7588#false} havoc ~x~0;~x~0 := 0; {7588#false} is VALID [2018-11-23 12:07:48,702 INFO L273 TraceCheckUtils]: 94: Hoare triple {7588#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {7588#false} is VALID [2018-11-23 12:07:48,703 INFO L256 TraceCheckUtils]: 95: Hoare triple {7588#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7588#false} is VALID [2018-11-23 12:07:48,703 INFO L273 TraceCheckUtils]: 96: Hoare triple {7588#false} ~cond := #in~cond; {7588#false} is VALID [2018-11-23 12:07:48,703 INFO L273 TraceCheckUtils]: 97: Hoare triple {7588#false} assume 0 == ~cond; {7588#false} is VALID [2018-11-23 12:07:48,703 INFO L273 TraceCheckUtils]: 98: Hoare triple {7588#false} assume !false; {7588#false} is VALID [2018-11-23 12:07:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 79 proven. 143 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-11-23 12:07:48,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:48,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-11-23 12:07:48,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2018-11-23 12:07:48,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:48,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:07:50,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:50,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:07:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:07:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:07:50,976 INFO L87 Difference]: Start difference. First operand 199 states and 262 transitions. Second operand 33 states. [2018-11-23 12:07:52,352 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:08:08,673 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-23 12:08:13,088 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 12:08:15,020 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 12:08:35,041 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 12:08:56,774 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-23 12:08:59,946 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-11-23 12:09:07,023 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17