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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:50:06,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:50:06,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:50:06,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:50:06,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:50:06,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:50:06,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:50:06,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:50:06,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:50:06,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:50:06,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:50:06,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:50:06,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:50:06,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:50:06,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:50:06,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:50:06,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:50:06,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:50:06,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:50:06,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:50:06,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:50:06,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:50:06,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:50:06,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:50:06,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:50:06,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:50:06,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:50:06,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:50:06,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:50:06,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:50:06,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:50:06,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:50:06,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:50:06,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:50:06,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:50:06,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:50:06,147 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-18 22:50:06,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:50:06,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:50:06,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:50:06,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:50:06,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:50:06,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:50:06,173 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:50:06,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:50:06,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:50:06,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:50:06,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:50:06,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:50:06,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:50:06,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:50:06,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:50:06,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:50:06,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:50:06,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:50:06,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:50:06,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:50:06,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:50:06,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:50:06,177 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:50:06,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:50:06,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:50:06,178 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:50:06,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:50:06,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:50:06,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:50:06,241 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:50:06,242 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:50:06,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i [2018-11-18 22:50:06,308 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ed1e19c/43b70267b57643f88b409d7b233ab107/FLAGf2b6a029c [2018-11-18 22:50:06,721 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:50:06,721 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compare_true-unreach-call_ground.i [2018-11-18 22:50:06,728 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ed1e19c/43b70267b57643f88b409d7b233ab107/FLAGf2b6a029c [2018-11-18 22:50:07,089 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ed1e19c/43b70267b57643f88b409d7b233ab107 [2018-11-18 22:50:07,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:50:07,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:50:07,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:50:07,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:50:07,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:50:07,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19076c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07, skipping insertion in model container [2018-11-18 22:50:07,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:50:07,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:50:07,386 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:50:07,392 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:50:07,424 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:50:07,448 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:50:07,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07 WrapperNode [2018-11-18 22:50:07,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:50:07,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:50:07,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:50:07,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:50:07,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (1/1) ... [2018-11-18 22:50:07,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:50:07,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:50:07,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:50:07,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:50:07,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (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-18 22:50:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:50:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:50:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:50:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:50:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:50:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:50:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:50:07,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:50:08,195 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:50:08,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:08 BoogieIcfgContainer [2018-11-18 22:50:08,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:50:08,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:50:08,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:50:08,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:50:08,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:50:07" (1/3) ... [2018-11-18 22:50:08,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a599d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:08, skipping insertion in model container [2018-11-18 22:50:08,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:07" (2/3) ... [2018-11-18 22:50:08,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a599d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:08, skipping insertion in model container [2018-11-18 22:50:08,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:08" (3/3) ... [2018-11-18 22:50:08,205 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compare_true-unreach-call_ground.i [2018-11-18 22:50:08,213 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:50:08,221 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:50:08,236 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:50:08,268 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:50:08,269 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:50:08,269 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:50:08,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:50:08,270 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:50:08,270 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:50:08,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:50:08,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:50:08,271 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:50:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-18 22:50:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:50:08,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:08,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:08,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:08,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:08,304 INFO L82 PathProgramCache]: Analyzing trace with hash 88071907, now seen corresponding path program 1 times [2018-11-18 22:50:08,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:08,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:08,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:08,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:08,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-18 22:50:08,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-18 22:50:08,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-18 22:50:08,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #62#return; {30#true} is VALID [2018-11-18 22:50:08,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2018-11-18 22:50:08,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {30#true} is VALID [2018-11-18 22:50:08,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-18 22:50:08,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-18 22:50:08,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-18 22:50:08,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {31#false} is VALID [2018-11-18 22:50:08,461 INFO L256 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {31#false} is VALID [2018-11-18 22:50:08,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-18 22:50:08,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-18 22:50:08,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-18 22:50:08,465 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-18 22:50:08,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:50:08,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:50:08,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:08,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:50:08,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:08,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:50:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:50:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:50:08,604 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-18 22:50:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:08,921 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-18 22:50:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:50:08,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:50:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:50:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-18 22:50:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:50:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-18 22:50:08,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-18 22:50:09,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:09,127 INFO L225 Difference]: With dead ends: 44 [2018-11-18 22:50:09,128 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:50:09,131 INFO L604 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-18 22:50:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:50:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 22:50:09,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:09,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 22:50:09,260 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:50:09,261 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:50:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:09,265 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:50:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:50:09,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:09,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:09,266 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:50:09,266 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:50:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:09,271 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:50:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:50:09,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:09,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:09,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:09,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:50:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 22:50:09,277 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-18 22:50:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:09,277 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 22:50:09,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:50:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:50:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:50:09,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:09,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:09,279 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:09,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -18684055, now seen corresponding path program 1 times [2018-11-18 22:50:09,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:09,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2018-11-18 22:50:09,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {163#true} is VALID [2018-11-18 22:50:09,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2018-11-18 22:50:09,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #62#return; {163#true} is VALID [2018-11-18 22:50:09,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret5 := main(); {163#true} is VALID [2018-11-18 22:50:09,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {165#(= main_~i~0 0)} is VALID [2018-11-18 22:50:09,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} assume true; {165#(= main_~i~0 0)} is VALID [2018-11-18 22:50:09,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {165#(= main_~i~0 0)} assume !(~i~0 < 100000); {164#false} is VALID [2018-11-18 22:50:09,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {164#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {164#false} is VALID [2018-11-18 22:50:09,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {164#false} assume true; {164#false} is VALID [2018-11-18 22:50:09,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {164#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {164#false} is VALID [2018-11-18 22:50:09,480 INFO L256 TraceCheckUtils]: 11: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {164#false} is VALID [2018-11-18 22:50:09,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2018-11-18 22:50:09,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2018-11-18 22:50:09,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {164#false} assume !false; {164#false} is VALID [2018-11-18 22:50:09,482 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-18 22:50:09,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:09,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:50:09,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:50:09,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:09,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:50:09,559 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-18 22:50:09,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:50:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:50:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:50:09,560 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-18 22:50:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:09,758 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-18 22:50:09,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:50:09,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:50:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:50:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:50:09,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-18 22:50:09,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:09,930 INFO L225 Difference]: With dead ends: 38 [2018-11-18 22:50:09,930 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 22:50:09,931 INFO L604 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-18 22:50:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 22:50:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-18 22:50:09,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:09,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-18 22:50:09,962 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-18 22:50:09,962 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-18 22:50:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:09,966 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 22:50:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 22:50:09,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:09,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:09,967 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-18 22:50:09,967 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-18 22:50:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:09,970 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 22:50:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 22:50:09,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:09,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:09,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:09,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:50:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-18 22:50:09,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-11-18 22:50:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:09,974 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 22:50:09,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:50:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-18 22:50:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:50:09,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:09,975 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:09,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:09,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash 750614591, now seen corresponding path program 1 times [2018-11-18 22:50:09,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:09,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:10,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-18 22:50:10,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-18 22:50:10,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-18 22:50:10,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #62#return; {303#true} is VALID [2018-11-18 22:50:10,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret5 := main(); {303#true} is VALID [2018-11-18 22:50:10,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {303#true} is VALID [2018-11-18 22:50:10,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-18 22:50:10,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {303#true} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {303#true} is VALID [2018-11-18 22:50:10,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {303#true} assume #t~mem0 != #t~mem1;havoc #t~mem1;havoc #t~mem0;~rv~0 := 0; {305#(= main_~rv~0 0)} is VALID [2018-11-18 22:50:10,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#(= main_~rv~0 0)} ~i~0 := 1 + ~i~0; {305#(= main_~rv~0 0)} is VALID [2018-11-18 22:50:10,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#(= main_~rv~0 0)} assume true; {305#(= main_~rv~0 0)} is VALID [2018-11-18 22:50:10,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {305#(= main_~rv~0 0)} assume !(~i~0 < 100000); {305#(= main_~rv~0 0)} is VALID [2018-11-18 22:50:10,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {305#(= main_~rv~0 0)} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-18 22:50:10,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume true; {304#false} is VALID [2018-11-18 22:50:10,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {304#false} is VALID [2018-11-18 22:50:10,249 INFO L256 TraceCheckUtils]: 15: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {304#false} is VALID [2018-11-18 22:50:10,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-18 22:50:10,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-18 22:50:10,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-18 22:50:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:10,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:50:10,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:50:10,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 22:50:10,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:10,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:50:10,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:10,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:50:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:50:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:50:10,412 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-18 22:50:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:10,510 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-18 22:50:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:50:10,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 22:50:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:50:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:50:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-18 22:50:10,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-18 22:50:10,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:10,593 INFO L225 Difference]: With dead ends: 40 [2018-11-18 22:50:10,593 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 22:50:10,594 INFO L604 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-18 22:50:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 22:50:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 22:50:10,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:10,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-18 22:50:10,606 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:50:10,606 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:50:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:10,609 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 22:50:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 22:50:10,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:10,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:10,610 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:50:10,610 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:50:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:10,612 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 22:50:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 22:50:10,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:10,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:10,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:10,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:50:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 22:50:10,615 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2018-11-18 22:50:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:10,616 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 22:50:10,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:50:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 22:50:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:50:10,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:10,617 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:10,617 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:10,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1451679169, now seen corresponding path program 1 times [2018-11-18 22:50:10,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:10,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:10,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-18 22:50:10,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {442#true} is VALID [2018-11-18 22:50:10,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-18 22:50:10,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #62#return; {442#true} is VALID [2018-11-18 22:50:10,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret5 := main(); {442#true} is VALID [2018-11-18 22:50:10,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {444#(= main_~i~0 0)} is VALID [2018-11-18 22:50:10,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(= main_~i~0 0)} assume true; {444#(= main_~i~0 0)} is VALID [2018-11-18 22:50:10,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {444#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {444#(= main_~i~0 0)} is VALID [2018-11-18 22:50:10,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {444#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {444#(= main_~i~0 0)} is VALID [2018-11-18 22:50:10,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {444#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {445#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:10,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 1)} assume true; {445#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:10,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 1)} assume !(~i~0 < 100000); {443#false} is VALID [2018-11-18 22:50:10,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {443#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {443#false} is VALID [2018-11-18 22:50:10,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#false} assume true; {443#false} is VALID [2018-11-18 22:50:10,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {443#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {443#false} is VALID [2018-11-18 22:50:10,815 INFO L256 TraceCheckUtils]: 15: Hoare triple {443#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {443#false} is VALID [2018-11-18 22:50:10,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {443#false} ~cond := #in~cond; {443#false} is VALID [2018-11-18 22:50:10,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {443#false} assume 0 == ~cond; {443#false} is VALID [2018-11-18 22:50:10,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-18 22:50:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:10,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:10,817 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-18 22:50:10,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:10,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:11,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-18 22:50:11,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {442#true} is VALID [2018-11-18 22:50:11,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-18 22:50:11,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {442#true} {442#true} #62#return; {442#true} is VALID [2018-11-18 22:50:11,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {442#true} call #t~ret5 := main(); {442#true} is VALID [2018-11-18 22:50:11,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {464#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {464#(<= main_~i~0 0)} assume true; {464#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {464#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {464#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {464#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {464#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {464#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {445#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 1)} assume true; {445#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 1)} assume !(~i~0 < 100000); {443#false} is VALID [2018-11-18 22:50:11,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {443#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {443#false} is VALID [2018-11-18 22:50:11,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#false} assume true; {443#false} is VALID [2018-11-18 22:50:11,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {443#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {443#false} is VALID [2018-11-18 22:50:11,159 INFO L256 TraceCheckUtils]: 15: Hoare triple {443#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {443#false} is VALID [2018-11-18 22:50:11,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {443#false} ~cond := #in~cond; {443#false} is VALID [2018-11-18 22:50:11,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {443#false} assume 0 == ~cond; {443#false} is VALID [2018-11-18 22:50:11,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-18 22:50:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:11,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:50:11,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:50:11,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:11,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:50:11,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:11,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:50:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:50:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:50:11,246 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-18 22:50:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:11,483 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-18 22:50:11,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:50:11,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:50:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:50:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-18 22:50:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:50:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-18 22:50:11,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2018-11-18 22:50:11,645 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-18 22:50:11,647 INFO L225 Difference]: With dead ends: 42 [2018-11-18 22:50:11,647 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 22:50:11,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:50:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 22:50:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-18 22:50:11,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:11,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-18 22:50:11,670 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-18 22:50:11,670 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-18 22:50:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:11,673 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 22:50:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-18 22:50:11,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:11,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:11,674 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-18 22:50:11,674 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-18 22:50:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:11,676 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 22:50:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-18 22:50:11,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:11,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:11,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:11,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:50:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-18 22:50:11,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-11-18 22:50:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:11,680 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-18 22:50:11,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:50:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-18 22:50:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:50:11,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:11,682 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:11,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:11,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:11,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1273501671, now seen corresponding path program 2 times [2018-11-18 22:50:11,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:11,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:11,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:11,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {656#true} is VALID [2018-11-18 22:50:11,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {656#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {656#true} is VALID [2018-11-18 22:50:11,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2018-11-18 22:50:11,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} #62#return; {656#true} is VALID [2018-11-18 22:50:11,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {656#true} call #t~ret5 := main(); {656#true} is VALID [2018-11-18 22:50:11,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {656#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {658#(= main_~i~0 0)} is VALID [2018-11-18 22:50:11,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {658#(= main_~i~0 0)} assume true; {658#(= main_~i~0 0)} is VALID [2018-11-18 22:50:11,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {658#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {658#(= main_~i~0 0)} is VALID [2018-11-18 22:50:11,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {658#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {658#(= main_~i~0 0)} is VALID [2018-11-18 22:50:11,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {658#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {659#(<= main_~i~0 1)} assume true; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {660#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:11,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {660#(<= main_~i~0 2)} assume true; {660#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:11,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {660#(<= main_~i~0 2)} assume !(~i~0 < 100000); {657#false} is VALID [2018-11-18 22:50:11,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {657#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {657#false} is VALID [2018-11-18 22:50:11,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {657#false} assume true; {657#false} is VALID [2018-11-18 22:50:11,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {657#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {657#false} is VALID [2018-11-18 22:50:11,819 INFO L256 TraceCheckUtils]: 19: Hoare triple {657#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {657#false} is VALID [2018-11-18 22:50:11,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {657#false} ~cond := #in~cond; {657#false} is VALID [2018-11-18 22:50:11,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {657#false} assume 0 == ~cond; {657#false} is VALID [2018-11-18 22:50:11,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {657#false} assume !false; {657#false} is VALID [2018-11-18 22:50:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:11,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:11,822 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-18 22:50:11,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:11,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:11,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:11,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:11,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {656#true} is VALID [2018-11-18 22:50:11,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {656#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {656#true} is VALID [2018-11-18 22:50:11,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2018-11-18 22:50:11,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} #62#return; {656#true} is VALID [2018-11-18 22:50:11,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {656#true} call #t~ret5 := main(); {656#true} is VALID [2018-11-18 22:50:11,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {656#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {679#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {679#(<= main_~i~0 0)} assume true; {679#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {679#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {679#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {679#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:11,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {659#(<= main_~i~0 1)} assume true; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:11,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {659#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {660#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {660#(<= main_~i~0 2)} assume true; {660#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {660#(<= main_~i~0 2)} assume !(~i~0 < 100000); {657#false} is VALID [2018-11-18 22:50:12,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {657#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {657#false} is VALID [2018-11-18 22:50:12,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {657#false} assume true; {657#false} is VALID [2018-11-18 22:50:12,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {657#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {657#false} is VALID [2018-11-18 22:50:12,013 INFO L256 TraceCheckUtils]: 19: Hoare triple {657#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {657#false} is VALID [2018-11-18 22:50:12,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {657#false} ~cond := #in~cond; {657#false} is VALID [2018-11-18 22:50:12,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {657#false} assume 0 == ~cond; {657#false} is VALID [2018-11-18 22:50:12,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {657#false} assume !false; {657#false} is VALID [2018-11-18 22:50:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:12,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:50:12,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:50:12,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:12,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:50:12,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:12,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:50:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:50:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:50:12,074 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2018-11-18 22:50:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:12,295 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-18 22:50:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:50:12,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:50:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:50:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 22:50:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:50:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 22:50:12,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2018-11-18 22:50:12,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:12,366 INFO L225 Difference]: With dead ends: 46 [2018-11-18 22:50:12,366 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 22:50:12,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-18 22:50:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 22:50:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 22:50:12,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:12,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-18 22:50:12,380 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-18 22:50:12,380 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-18 22:50:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:12,383 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 22:50:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-18 22:50:12,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:12,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:12,384 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-18 22:50:12,384 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-18 22:50:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:12,386 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 22:50:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-18 22:50:12,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:12,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:12,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:12,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:50:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-18 22:50:12,389 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2018-11-18 22:50:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:12,389 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-18 22:50:12,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:50:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-18 22:50:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:50:12,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:12,391 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:12,391 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:12,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1928070769, now seen corresponding path program 3 times [2018-11-18 22:50:12,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:12,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:12,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:12,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2018-11-18 22:50:12,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {901#true} is VALID [2018-11-18 22:50:12,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2018-11-18 22:50:12,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #62#return; {901#true} is VALID [2018-11-18 22:50:12,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret5 := main(); {901#true} is VALID [2018-11-18 22:50:12,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {903#(= main_~i~0 0)} is VALID [2018-11-18 22:50:12,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {903#(= main_~i~0 0)} assume true; {903#(= main_~i~0 0)} is VALID [2018-11-18 22:50:12,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {903#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {903#(= main_~i~0 0)} is VALID [2018-11-18 22:50:12,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {903#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {903#(= main_~i~0 0)} is VALID [2018-11-18 22:50:12,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {904#(<= main_~i~0 1)} assume true; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {904#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {904#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {905#(<= main_~i~0 2)} assume true; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {905#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {905#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {906#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:12,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {906#(<= main_~i~0 3)} assume true; {906#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:12,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {906#(<= main_~i~0 3)} assume !(~i~0 < 100000); {902#false} is VALID [2018-11-18 22:50:12,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {902#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {902#false} is VALID [2018-11-18 22:50:12,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {902#false} assume true; {902#false} is VALID [2018-11-18 22:50:12,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {902#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {902#false} is VALID [2018-11-18 22:50:12,528 INFO L256 TraceCheckUtils]: 23: Hoare triple {902#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {902#false} is VALID [2018-11-18 22:50:12,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2018-11-18 22:50:12,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2018-11-18 22:50:12,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {902#false} assume !false; {902#false} is VALID [2018-11-18 22:50:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:12,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:12,531 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-18 22:50:12,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:12,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:50:12,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:12,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:12,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2018-11-18 22:50:12,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {901#true} is VALID [2018-11-18 22:50:12,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2018-11-18 22:50:12,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #62#return; {901#true} is VALID [2018-11-18 22:50:12,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret5 := main(); {901#true} is VALID [2018-11-18 22:50:12,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {901#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {925#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:12,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(<= main_~i~0 0)} assume true; {925#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:12,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {925#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {925#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:12,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {925#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {925#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:12,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {925#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {904#(<= main_~i~0 1)} assume true; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {904#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {904#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:12,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {904#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {905#(<= main_~i~0 2)} assume true; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {905#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {905#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:12,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {905#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {906#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:12,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {906#(<= main_~i~0 3)} assume true; {906#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:12,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {906#(<= main_~i~0 3)} assume !(~i~0 < 100000); {902#false} is VALID [2018-11-18 22:50:12,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {902#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {902#false} is VALID [2018-11-18 22:50:12,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {902#false} assume true; {902#false} is VALID [2018-11-18 22:50:12,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {902#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {902#false} is VALID [2018-11-18 22:50:12,672 INFO L256 TraceCheckUtils]: 23: Hoare triple {902#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {902#false} is VALID [2018-11-18 22:50:12,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {902#false} ~cond := #in~cond; {902#false} is VALID [2018-11-18 22:50:12,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {902#false} assume 0 == ~cond; {902#false} is VALID [2018-11-18 22:50:12,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {902#false} assume !false; {902#false} is VALID [2018-11-18 22:50:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:12,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:50:12,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:50:12,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:12,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:50:12,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:12,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:50:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:50:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:50:12,755 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2018-11-18 22:50:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:12,927 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-18 22:50:12,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:50:12,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:50:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:50:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-18 22:50:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:50:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-18 22:50:12,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-18 22:50:13,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:13,084 INFO L225 Difference]: With dead ends: 50 [2018-11-18 22:50:13,084 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 22:50:13,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:50:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 22:50:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-18 22:50:13,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:13,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-18 22:50:13,135 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-18 22:50:13,135 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-18 22:50:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:13,138 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-18 22:50:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-18 22:50:13,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:13,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:13,139 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-18 22:50:13,139 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-18 22:50:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:13,141 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-18 22:50:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-18 22:50:13,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:13,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:13,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:13,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:50:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 22:50:13,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2018-11-18 22:50:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:13,149 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 22:50:13,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:50:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-18 22:50:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:50:13,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:13,150 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:13,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:13,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1398356169, now seen corresponding path program 4 times [2018-11-18 22:50:13,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:13,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:13,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:13,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2018-11-18 22:50:13,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1177#true} is VALID [2018-11-18 22:50:13,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2018-11-18 22:50:13,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #62#return; {1177#true} is VALID [2018-11-18 22:50:13,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2018-11-18 22:50:13,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1179#(= main_~i~0 0)} is VALID [2018-11-18 22:50:13,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~i~0 0)} assume true; {1179#(= main_~i~0 0)} is VALID [2018-11-18 22:50:13,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1179#(= main_~i~0 0)} is VALID [2018-11-18 22:50:13,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {1179#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1179#(= main_~i~0 0)} is VALID [2018-11-18 22:50:13,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {1179#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {1180#(<= main_~i~0 1)} assume true; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {1180#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {1180#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {1180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {1181#(<= main_~i~0 2)} assume true; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {1181#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {1181#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {1182#(<= main_~i~0 3)} assume true; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {1182#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {1182#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1183#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:13,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {1183#(<= main_~i~0 4)} assume true; {1183#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:13,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {1183#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1178#false} is VALID [2018-11-18 22:50:13,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {1178#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1178#false} is VALID [2018-11-18 22:50:13,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {1178#false} assume true; {1178#false} is VALID [2018-11-18 22:50:13,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {1178#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1178#false} is VALID [2018-11-18 22:50:13,322 INFO L256 TraceCheckUtils]: 27: Hoare triple {1178#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1178#false} is VALID [2018-11-18 22:50:13,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {1178#false} ~cond := #in~cond; {1178#false} is VALID [2018-11-18 22:50:13,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {1178#false} assume 0 == ~cond; {1178#false} is VALID [2018-11-18 22:50:13,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2018-11-18 22:50:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:13,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:13,325 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-18 22:50:13,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:50:13,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:50:13,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:13,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:13,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2018-11-18 22:50:13,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1177#true} is VALID [2018-11-18 22:50:13,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2018-11-18 22:50:13,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #62#return; {1177#true} is VALID [2018-11-18 22:50:13,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2018-11-18 22:50:13,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1202#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:13,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {1202#(<= main_~i~0 0)} assume true; {1202#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:13,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {1202#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1202#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:13,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {1202#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1202#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:13,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {1202#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {1180#(<= main_~i~0 1)} assume true; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {1180#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {1180#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1180#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:13,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {1180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {1181#(<= main_~i~0 2)} assume true; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {1181#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1181#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:13,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {1181#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {1182#(<= main_~i~0 3)} assume true; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {1182#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {1182#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1182#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:13,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1183#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:13,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {1183#(<= main_~i~0 4)} assume true; {1183#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:13,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {1183#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1178#false} is VALID [2018-11-18 22:50:13,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {1178#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1178#false} is VALID [2018-11-18 22:50:13,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {1178#false} assume true; {1178#false} is VALID [2018-11-18 22:50:13,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {1178#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1178#false} is VALID [2018-11-18 22:50:13,578 INFO L256 TraceCheckUtils]: 27: Hoare triple {1178#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1178#false} is VALID [2018-11-18 22:50:13,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {1178#false} ~cond := #in~cond; {1178#false} is VALID [2018-11-18 22:50:13,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {1178#false} assume 0 == ~cond; {1178#false} is VALID [2018-11-18 22:50:13,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2018-11-18 22:50:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:13,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:50:13,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:50:13,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:13,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:50:13,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:13,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:50:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:50:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:50:13,672 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2018-11-18 22:50:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:13,885 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-18 22:50:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:50:13,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:50:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:50:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-18 22:50:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:50:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-18 22:50:13,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-18 22:50:13,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:13,963 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:50:13,963 INFO L226 Difference]: Without dead ends: 42 [2018-11-18 22:50:13,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:50:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-18 22:50:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-18 22:50:13,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:13,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-18 22:50:13,999 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-18 22:50:13,999 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-18 22:50:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:14,002 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-18 22:50:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-18 22:50:14,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:14,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:14,003 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-18 22:50:14,003 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-18 22:50:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:14,005 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-18 22:50:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-18 22:50:14,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:14,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:14,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:14,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:50:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-18 22:50:14,008 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 31 [2018-11-18 22:50:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:14,008 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-18 22:50:14,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:50:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-18 22:50:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:50:14,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:14,010 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:14,010 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:14,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -88768735, now seen corresponding path program 5 times [2018-11-18 22:50:14,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:14,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:14,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2018-11-18 22:50:14,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {1484#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1484#true} is VALID [2018-11-18 22:50:14,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2018-11-18 22:50:14,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #62#return; {1484#true} is VALID [2018-11-18 22:50:14,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2018-11-18 22:50:14,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {1484#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1486#(= main_~i~0 0)} is VALID [2018-11-18 22:50:14,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {1486#(= main_~i~0 0)} assume true; {1486#(= main_~i~0 0)} is VALID [2018-11-18 22:50:14,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {1486#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1486#(= main_~i~0 0)} is VALID [2018-11-18 22:50:14,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {1486#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1486#(= main_~i~0 0)} is VALID [2018-11-18 22:50:14,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {1486#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {1487#(<= main_~i~0 1)} assume true; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {1487#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {1488#(<= main_~i~0 2)} assume true; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {1488#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {1488#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {1488#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {1489#(<= main_~i~0 3)} assume true; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {1489#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {1489#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1489#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {1490#(<= main_~i~0 4)} assume true; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1490#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {1490#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {1490#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1491#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:14,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {1491#(<= main_~i~0 5)} assume true; {1491#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:14,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {1491#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1485#false} is VALID [2018-11-18 22:50:14,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {1485#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1485#false} is VALID [2018-11-18 22:50:14,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {1485#false} assume true; {1485#false} is VALID [2018-11-18 22:50:14,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {1485#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1485#false} is VALID [2018-11-18 22:50:14,204 INFO L256 TraceCheckUtils]: 31: Hoare triple {1485#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1485#false} is VALID [2018-11-18 22:50:14,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2018-11-18 22:50:14,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2018-11-18 22:50:14,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2018-11-18 22:50:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:14,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:14,208 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-18 22:50:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:50:14,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:50:14,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:14,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:14,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2018-11-18 22:50:14,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {1484#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1484#true} is VALID [2018-11-18 22:50:14,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2018-11-18 22:50:14,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #62#return; {1484#true} is VALID [2018-11-18 22:50:14,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2018-11-18 22:50:14,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {1484#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1510#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:14,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {1510#(<= main_~i~0 0)} assume true; {1510#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:14,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {1510#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1510#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:14,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {1510#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1510#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:14,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {1510#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {1487#(<= main_~i~0 1)} assume true; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {1487#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1487#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:14,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {1488#(<= main_~i~0 2)} assume true; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {1488#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {1488#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1488#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:14,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {1488#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {1489#(<= main_~i~0 3)} assume true; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {1489#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {1489#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1489#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:14,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {1489#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {1490#(<= main_~i~0 4)} assume true; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {1490#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {1490#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1490#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:14,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {1490#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1491#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:14,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {1491#(<= main_~i~0 5)} assume true; {1491#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:14,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {1491#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1485#false} is VALID [2018-11-18 22:50:14,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {1485#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1485#false} is VALID [2018-11-18 22:50:14,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {1485#false} assume true; {1485#false} is VALID [2018-11-18 22:50:14,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {1485#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1485#false} is VALID [2018-11-18 22:50:14,553 INFO L256 TraceCheckUtils]: 31: Hoare triple {1485#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1485#false} is VALID [2018-11-18 22:50:14,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2018-11-18 22:50:14,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2018-11-18 22:50:14,554 INFO L273 TraceCheckUtils]: 34: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2018-11-18 22:50:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:14,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:14,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:50:14,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:50:14,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:14,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:50:14,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:14,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:50:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:50:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:50:14,632 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-11-18 22:50:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:14,798 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-18 22:50:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:50:14,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:50:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:50:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-18 22:50:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:50:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-18 22:50:14,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2018-11-18 22:50:14,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:14,955 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:50:14,955 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 22:50:14,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:50:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 22:50:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-18 22:50:14,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:14,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-18 22:50:14,974 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-18 22:50:14,974 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-18 22:50:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:14,976 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-18 22:50:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-18 22:50:14,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:14,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:14,978 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-18 22:50:14,978 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-18 22:50:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:14,980 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-18 22:50:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-18 22:50:14,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:14,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:14,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:14,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:50:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-18 22:50:14,985 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-11-18 22:50:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:14,986 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-18 22:50:14,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:50:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-18 22:50:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:50:14,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:14,987 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:14,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:14,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1935071609, now seen corresponding path program 6 times [2018-11-18 22:50:14,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:14,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:15,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2018-11-18 22:50:15,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1822#true} is VALID [2018-11-18 22:50:15,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2018-11-18 22:50:15,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #62#return; {1822#true} is VALID [2018-11-18 22:50:15,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret5 := main(); {1822#true} is VALID [2018-11-18 22:50:15,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1824#(= main_~i~0 0)} is VALID [2018-11-18 22:50:15,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {1824#(= main_~i~0 0)} assume true; {1824#(= main_~i~0 0)} is VALID [2018-11-18 22:50:15,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {1824#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1824#(= main_~i~0 0)} is VALID [2018-11-18 22:50:15,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {1824#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1824#(= main_~i~0 0)} is VALID [2018-11-18 22:50:15,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {1824#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {1825#(<= main_~i~0 1)} assume true; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {1825#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {1825#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {1825#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {1826#(<= main_~i~0 2)} assume true; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {1826#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {1826#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {1827#(<= main_~i~0 3)} assume true; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {1827#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {1827#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {1827#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {1828#(<= main_~i~0 4)} assume true; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {1828#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {1828#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {1828#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {1829#(<= main_~i~0 5)} assume true; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {1829#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {1829#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {1829#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1830#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:15,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {1830#(<= main_~i~0 6)} assume true; {1830#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:15,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {1830#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1823#false} is VALID [2018-11-18 22:50:15,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1823#false} is VALID [2018-11-18 22:50:15,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {1823#false} assume true; {1823#false} is VALID [2018-11-18 22:50:15,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {1823#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1823#false} is VALID [2018-11-18 22:50:15,227 INFO L256 TraceCheckUtils]: 35: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1823#false} is VALID [2018-11-18 22:50:15,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2018-11-18 22:50:15,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2018-11-18 22:50:15,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2018-11-18 22:50:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:15,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:15,230 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-18 22:50:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:50:15,295 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:50:15,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:15,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:15,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2018-11-18 22:50:15,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1822#true} is VALID [2018-11-18 22:50:15,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2018-11-18 22:50:15,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #62#return; {1822#true} is VALID [2018-11-18 22:50:15,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret5 := main(); {1822#true} is VALID [2018-11-18 22:50:15,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {1849#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:15,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {1849#(<= main_~i~0 0)} assume true; {1849#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:15,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {1849#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1849#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:15,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {1849#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1849#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:15,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {1849#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {1825#(<= main_~i~0 1)} assume true; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {1825#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1825#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1825#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:15,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1825#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {1826#(<= main_~i~0 2)} assume true; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {1826#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1826#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:15,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {1826#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {1827#(<= main_~i~0 3)} assume true; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {1827#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {1827#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1827#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:15,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {1827#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {1828#(<= main_~i~0 4)} assume true; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {1828#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {1828#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1828#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:15,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {1828#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {1829#(<= main_~i~0 5)} assume true; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {1829#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {1829#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {1829#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:15,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {1829#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1830#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:15,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {1830#(<= main_~i~0 6)} assume true; {1830#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:15,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {1830#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1823#false} is VALID [2018-11-18 22:50:15,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {1823#false} is VALID [2018-11-18 22:50:15,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {1823#false} assume true; {1823#false} is VALID [2018-11-18 22:50:15,623 INFO L273 TraceCheckUtils]: 34: Hoare triple {1823#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1823#false} is VALID [2018-11-18 22:50:15,623 INFO L256 TraceCheckUtils]: 35: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1823#false} is VALID [2018-11-18 22:50:15,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2018-11-18 22:50:15,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2018-11-18 22:50:15,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2018-11-18 22:50:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:50:15,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:50:15,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:15,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:50:15,713 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-18 22:50:15,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:50:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:50:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:50:15,715 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 10 states. [2018-11-18 22:50:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:16,151 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-18 22:50:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:50:16,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:50:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:50:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-18 22:50:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:50:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-18 22:50:16,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2018-11-18 22:50:16,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:16,275 INFO L225 Difference]: With dead ends: 62 [2018-11-18 22:50:16,275 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 22:50:16,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:50:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 22:50:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 22:50:16,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:16,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-18 22:50:16,350 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-18 22:50:16,351 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-18 22:50:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:16,353 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-18 22:50:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-18 22:50:16,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:16,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:16,353 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-18 22:50:16,353 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-18 22:50:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:16,355 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-18 22:50:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-18 22:50:16,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:16,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:16,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:16,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:50:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-18 22:50:16,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-11-18 22:50:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:16,358 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-18 22:50:16,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:50:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-18 22:50:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 22:50:16,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:16,359 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:16,359 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:16,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1399633967, now seen corresponding path program 7 times [2018-11-18 22:50:16,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:16,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:16,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:16,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2018-11-18 22:50:16,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {2191#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2191#true} is VALID [2018-11-18 22:50:16,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {2191#true} assume true; {2191#true} is VALID [2018-11-18 22:50:16,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2191#true} {2191#true} #62#return; {2191#true} is VALID [2018-11-18 22:50:16,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {2191#true} call #t~ret5 := main(); {2191#true} is VALID [2018-11-18 22:50:16,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {2191#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2193#(= main_~i~0 0)} is VALID [2018-11-18 22:50:16,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {2193#(= main_~i~0 0)} assume true; {2193#(= main_~i~0 0)} is VALID [2018-11-18 22:50:16,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {2193#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2193#(= main_~i~0 0)} is VALID [2018-11-18 22:50:16,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {2193#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2193#(= main_~i~0 0)} is VALID [2018-11-18 22:50:16,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {2193#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {2194#(<= main_~i~0 1)} assume true; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {2194#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {2194#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {2194#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {2195#(<= main_~i~0 2)} assume true; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {2195#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {2195#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {2195#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#(<= main_~i~0 3)} assume true; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {2197#(<= main_~i~0 4)} assume true; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {2197#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {2197#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {2197#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#(<= main_~i~0 5)} assume true; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,639 INFO L273 TraceCheckUtils]: 29: Hoare triple {2198#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {2199#(<= main_~i~0 6)} assume true; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {2199#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {2199#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {2199#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2200#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:16,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {2200#(<= main_~i~0 7)} assume true; {2200#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:16,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {2200#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2192#false} is VALID [2018-11-18 22:50:16,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {2192#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2192#false} is VALID [2018-11-18 22:50:16,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {2192#false} assume true; {2192#false} is VALID [2018-11-18 22:50:16,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2192#false} is VALID [2018-11-18 22:50:16,644 INFO L256 TraceCheckUtils]: 39: Hoare triple {2192#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2192#false} is VALID [2018-11-18 22:50:16,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2018-11-18 22:50:16,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2018-11-18 22:50:16,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2018-11-18 22:50:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:16,647 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-18 22:50:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:16,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:16,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2018-11-18 22:50:16,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {2191#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2191#true} is VALID [2018-11-18 22:50:16,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {2191#true} assume true; {2191#true} is VALID [2018-11-18 22:50:16,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2191#true} {2191#true} #62#return; {2191#true} is VALID [2018-11-18 22:50:16,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {2191#true} call #t~ret5 := main(); {2191#true} is VALID [2018-11-18 22:50:16,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {2191#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2219#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:16,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {2219#(<= main_~i~0 0)} assume true; {2219#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:16,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {2219#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2219#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:16,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {2219#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2219#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:16,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {2219#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {2194#(<= main_~i~0 1)} assume true; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {2194#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {2194#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2194#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:16,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {2194#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {2195#(<= main_~i~0 2)} assume true; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {2195#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {2195#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2195#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:16,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {2195#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#(<= main_~i~0 3)} assume true; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2196#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:16,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {2197#(<= main_~i~0 4)} assume true; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {2197#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {2197#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2197#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:16,899 INFO L273 TraceCheckUtils]: 25: Hoare triple {2197#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,899 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#(<= main_~i~0 5)} assume true; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2198#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:16,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {2198#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {2199#(<= main_~i~0 6)} assume true; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,901 INFO L273 TraceCheckUtils]: 31: Hoare triple {2199#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {2199#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2199#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:16,902 INFO L273 TraceCheckUtils]: 33: Hoare triple {2199#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2200#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:16,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {2200#(<= main_~i~0 7)} assume true; {2200#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:16,903 INFO L273 TraceCheckUtils]: 35: Hoare triple {2200#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2192#false} is VALID [2018-11-18 22:50:16,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {2192#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2192#false} is VALID [2018-11-18 22:50:16,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {2192#false} assume true; {2192#false} is VALID [2018-11-18 22:50:16,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2192#false} is VALID [2018-11-18 22:50:16,904 INFO L256 TraceCheckUtils]: 39: Hoare triple {2192#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2192#false} is VALID [2018-11-18 22:50:16,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2018-11-18 22:50:16,904 INFO L273 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2018-11-18 22:50:16,904 INFO L273 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2018-11-18 22:50:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:16,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:50:16,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:50:16,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:16,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:50:16,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:16,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:50:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:50:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:50:16,970 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2018-11-18 22:50:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:17,440 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-18 22:50:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:50:17,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:50:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:50:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-18 22:50:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:50:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-18 22:50:17,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-18 22:50:17,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:17,520 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:50:17,520 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 22:50:17,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:50:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 22:50:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 22:50:17,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:17,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-18 22:50:17,543 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-18 22:50:17,543 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-18 22:50:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:17,545 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-18 22:50:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-18 22:50:17,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:17,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:17,546 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-18 22:50:17,546 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-18 22:50:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:17,547 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-18 22:50:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-18 22:50:17,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:17,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:17,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:17,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:50:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-18 22:50:17,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 43 [2018-11-18 22:50:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:17,548 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-18 22:50:17,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:50:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-18 22:50:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:50:17,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:17,549 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:17,549 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:17,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -88028631, now seen corresponding path program 8 times [2018-11-18 22:50:17,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:17,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:17,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:17,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:17,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:17,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {2591#true} call ULTIMATE.init(); {2591#true} is VALID [2018-11-18 22:50:17,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {2591#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2591#true} is VALID [2018-11-18 22:50:17,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {2591#true} assume true; {2591#true} is VALID [2018-11-18 22:50:17,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2591#true} {2591#true} #62#return; {2591#true} is VALID [2018-11-18 22:50:17,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {2591#true} call #t~ret5 := main(); {2591#true} is VALID [2018-11-18 22:50:17,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {2591#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2593#(= main_~i~0 0)} is VALID [2018-11-18 22:50:17,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {2593#(= main_~i~0 0)} assume true; {2593#(= main_~i~0 0)} is VALID [2018-11-18 22:50:17,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {2593#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2593#(= main_~i~0 0)} is VALID [2018-11-18 22:50:17,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {2593#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2593#(= main_~i~0 0)} is VALID [2018-11-18 22:50:17,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {2593#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:17,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {2594#(<= main_~i~0 1)} assume true; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:17,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {2594#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:17,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {2594#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:17,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {2594#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:17,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {2595#(<= main_~i~0 2)} assume true; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:17,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {2595#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:17,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {2595#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:17,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {2595#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:17,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {2596#(<= main_~i~0 3)} assume true; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:17,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {2596#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:17,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {2596#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:17,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {2596#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:17,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#(<= main_~i~0 4)} assume true; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:17,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {2597#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:17,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {2597#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:17,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {2597#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:17,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {2598#(<= main_~i~0 5)} assume true; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:17,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {2598#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:17,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {2598#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:17,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {2598#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:17,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {2599#(<= main_~i~0 6)} assume true; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:17,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {2599#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:17,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {2599#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:17,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {2599#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:17,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {2600#(<= main_~i~0 7)} assume true; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:17,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {2600#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:17,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {2600#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:17,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {2600#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2601#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:17,766 INFO L273 TraceCheckUtils]: 38: Hoare triple {2601#(<= main_~i~0 8)} assume true; {2601#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:17,767 INFO L273 TraceCheckUtils]: 39: Hoare triple {2601#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2592#false} is VALID [2018-11-18 22:50:17,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {2592#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2592#false} is VALID [2018-11-18 22:50:17,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {2592#false} assume true; {2592#false} is VALID [2018-11-18 22:50:17,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {2592#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2592#false} is VALID [2018-11-18 22:50:17,768 INFO L256 TraceCheckUtils]: 43: Hoare triple {2592#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2592#false} is VALID [2018-11-18 22:50:17,768 INFO L273 TraceCheckUtils]: 44: Hoare triple {2592#false} ~cond := #in~cond; {2592#false} is VALID [2018-11-18 22:50:17,768 INFO L273 TraceCheckUtils]: 45: Hoare triple {2592#false} assume 0 == ~cond; {2592#false} is VALID [2018-11-18 22:50:17,769 INFO L273 TraceCheckUtils]: 46: Hoare triple {2592#false} assume !false; {2592#false} is VALID [2018-11-18 22:50:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:17,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:17,771 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-18 22:50:17,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:17,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:17,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:18,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {2591#true} call ULTIMATE.init(); {2591#true} is VALID [2018-11-18 22:50:18,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {2591#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2591#true} is VALID [2018-11-18 22:50:18,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {2591#true} assume true; {2591#true} is VALID [2018-11-18 22:50:18,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2591#true} {2591#true} #62#return; {2591#true} is VALID [2018-11-18 22:50:18,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {2591#true} call #t~ret5 := main(); {2591#true} is VALID [2018-11-18 22:50:18,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {2591#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {2620#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:18,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {2620#(<= main_~i~0 0)} assume true; {2620#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:18,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {2620#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2620#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:18,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {2620#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2620#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:18,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {2620#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:18,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {2594#(<= main_~i~0 1)} assume true; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:18,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {2594#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:18,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {2594#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2594#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:18,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {2594#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:18,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {2595#(<= main_~i~0 2)} assume true; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:18,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {2595#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:18,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {2595#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2595#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:18,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {2595#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:18,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {2596#(<= main_~i~0 3)} assume true; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:18,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {2596#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:18,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {2596#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2596#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:18,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {2596#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:18,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#(<= main_~i~0 4)} assume true; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:18,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {2597#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:18,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {2597#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2597#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:18,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {2597#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:18,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {2598#(<= main_~i~0 5)} assume true; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:18,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {2598#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:18,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {2598#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2598#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:18,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {2598#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:18,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {2599#(<= main_~i~0 6)} assume true; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:18,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {2599#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:18,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {2599#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2599#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:18,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {2599#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:18,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {2600#(<= main_~i~0 7)} assume true; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:18,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {2600#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:18,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {2600#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {2600#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:18,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {2600#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2601#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:18,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {2601#(<= main_~i~0 8)} assume true; {2601#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {2601#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {2592#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {2592#false} assume true; {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {2592#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L256 TraceCheckUtils]: 43: Hoare triple {2592#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {2592#false} ~cond := #in~cond; {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {2592#false} assume 0 == ~cond; {2592#false} is VALID [2018-11-18 22:50:18,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {2592#false} assume !false; {2592#false} is VALID [2018-11-18 22:50:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:50:18,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:50:18,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:18,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:50:18,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:50:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:50:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:50:18,317 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 12 states. [2018-11-18 22:50:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:18,561 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-18 22:50:18,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:50:18,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:50:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-18 22:50:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:50:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-18 22:50:18,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2018-11-18 22:50:18,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:18,630 INFO L225 Difference]: With dead ends: 70 [2018-11-18 22:50:18,630 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 22:50:18,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:50:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 22:50:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-18 22:50:18,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:18,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-18 22:50:18,651 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-18 22:50:18,651 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-18 22:50:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:18,652 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-18 22:50:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-18 22:50:18,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:18,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:18,653 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-18 22:50:18,653 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-18 22:50:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:18,654 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-18 22:50:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-18 22:50:18,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:18,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:18,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:18,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:50:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-18 22:50:18,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 47 [2018-11-18 22:50:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:18,656 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-18 22:50:18,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:50:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-18 22:50:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:50:18,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:18,656 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:18,657 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:18,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1758109567, now seen corresponding path program 9 times [2018-11-18 22:50:18,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:18,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:18,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:18,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:18,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:19,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {3022#true} call ULTIMATE.init(); {3022#true} is VALID [2018-11-18 22:50:19,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {3022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3022#true} is VALID [2018-11-18 22:50:19,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {3022#true} assume true; {3022#true} is VALID [2018-11-18 22:50:19,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3022#true} {3022#true} #62#return; {3022#true} is VALID [2018-11-18 22:50:19,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {3022#true} call #t~ret5 := main(); {3022#true} is VALID [2018-11-18 22:50:19,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {3022#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3024#(= main_~i~0 0)} is VALID [2018-11-18 22:50:19,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {3024#(= main_~i~0 0)} assume true; {3024#(= main_~i~0 0)} is VALID [2018-11-18 22:50:19,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {3024#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3024#(= main_~i~0 0)} is VALID [2018-11-18 22:50:19,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {3024#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3024#(= main_~i~0 0)} is VALID [2018-11-18 22:50:19,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {3024#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3025#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:19,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {3025#(<= main_~i~0 1)} assume true; {3025#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:19,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {3025#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3025#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:19,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {3025#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3025#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:19,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {3025#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3026#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:19,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {3026#(<= main_~i~0 2)} assume true; {3026#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:19,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {3026#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3026#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:19,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {3026#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3026#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:19,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {3026#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3027#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:19,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {3027#(<= main_~i~0 3)} assume true; {3027#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:19,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {3027#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3027#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:19,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {3027#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3027#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:19,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {3027#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3028#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:19,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {3028#(<= main_~i~0 4)} assume true; {3028#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:19,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {3028#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3028#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:19,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {3028#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3028#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:19,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {3028#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3029#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:19,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {3029#(<= main_~i~0 5)} assume true; {3029#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:19,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {3029#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3029#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:19,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {3029#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3029#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:19,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {3029#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3030#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:19,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {3030#(<= main_~i~0 6)} assume true; {3030#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:19,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {3030#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3030#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:19,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {3030#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3030#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:19,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {3030#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3031#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:19,640 INFO L273 TraceCheckUtils]: 34: Hoare triple {3031#(<= main_~i~0 7)} assume true; {3031#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:19,641 INFO L273 TraceCheckUtils]: 35: Hoare triple {3031#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3031#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:19,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {3031#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3031#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:19,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {3031#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3032#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:19,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {3032#(<= main_~i~0 8)} assume true; {3032#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:19,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {3032#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3032#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:19,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {3032#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3032#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:19,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {3032#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3033#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:19,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {3033#(<= main_~i~0 9)} assume true; {3033#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:19,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {3033#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3023#false} is VALID [2018-11-18 22:50:19,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {3023#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3023#false} is VALID [2018-11-18 22:50:19,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {3023#false} assume true; {3023#false} is VALID [2018-11-18 22:50:19,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {3023#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3023#false} is VALID [2018-11-18 22:50:19,647 INFO L256 TraceCheckUtils]: 47: Hoare triple {3023#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3023#false} is VALID [2018-11-18 22:50:19,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {3023#false} ~cond := #in~cond; {3023#false} is VALID [2018-11-18 22:50:19,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {3023#false} assume 0 == ~cond; {3023#false} is VALID [2018-11-18 22:50:19,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {3023#false} assume !false; {3023#false} is VALID [2018-11-18 22:50:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:50:19,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:19,650 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-18 22:50:19,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:19,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:50:19,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:19,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:19,861 INFO L477 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-18 22:50:19,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:19,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:19,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-18 22:50:20,455 INFO L477 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 26 treesize of output 22 [2018-11-18 22:50:20,463 INFO L477 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 13 treesize of output 5 [2018-11-18 22:50:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:20,475 INFO L477 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 11 treesize of output 3 [2018-11-18 22:50:20,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:20,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:20,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:20,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-18 22:50:20,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:50:20,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {3022#true} call ULTIMATE.init(); {3022#true} is VALID [2018-11-18 22:50:20,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {3022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3022#true} is VALID [2018-11-18 22:50:20,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {3022#true} assume true; {3022#true} is VALID [2018-11-18 22:50:20,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3022#true} {3022#true} #62#return; {3022#true} is VALID [2018-11-18 22:50:20,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {3022#true} call #t~ret5 := main(); {3022#true} is VALID [2018-11-18 22:50:20,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {3022#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3052#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {3052#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {3052#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {3052#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3059#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {3059#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,585 INFO L273 TraceCheckUtils]: 35: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,627 INFO L273 TraceCheckUtils]: 42: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {3063#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3172#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {3172#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {3172#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:20,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {3172#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) |main_~#b~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3179#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-18 22:50:20,632 INFO L256 TraceCheckUtils]: 47: Hoare triple {3179#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3183#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 22:50:20,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {3183#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3187#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:50:20,633 INFO L273 TraceCheckUtils]: 49: Hoare triple {3187#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3023#false} is VALID [2018-11-18 22:50:20,633 INFO L273 TraceCheckUtils]: 50: Hoare triple {3023#false} assume !false; {3023#false} is VALID [2018-11-18 22:50:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-18 22:50:20,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:20,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-11-18 22:50:20,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-18 22:50:20,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:20,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:50:20,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:20,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:50:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:50:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:50:20,747 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 19 states. [2018-11-18 22:50:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,377 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-18 22:50:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:50:22,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-18 22:50:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:50:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-18 22:50:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:50:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-18 22:50:22,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-18 22:50:22,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:22,492 INFO L225 Difference]: With dead ends: 83 [2018-11-18 22:50:22,492 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 22:50:22,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:50:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 22:50:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-18 22:50:22,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:22,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 67 states. [2018-11-18 22:50:22,594 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 67 states. [2018-11-18 22:50:22,594 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 67 states. [2018-11-18 22:50:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,596 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-18 22:50:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-18 22:50:22,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:22,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:22,597 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 71 states. [2018-11-18 22:50:22,597 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 71 states. [2018-11-18 22:50:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:22,599 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-18 22:50:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-18 22:50:22,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:22,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:22,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:22,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 22:50:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-18 22:50:22,602 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 51 [2018-11-18 22:50:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:22,602 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-18 22:50:22,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:50:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-18 22:50:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 22:50:22,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:22,603 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:22,603 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:22,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1665104317, now seen corresponding path program 1 times [2018-11-18 22:50:22,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:22,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:22,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2018-11-18 22:50:22,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {3558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3558#true} is VALID [2018-11-18 22:50:22,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2018-11-18 22:50:22,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #62#return; {3558#true} is VALID [2018-11-18 22:50:22,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {3558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3560#(= main_~i~0 0)} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {3560#(= main_~i~0 0)} assume true; {3560#(= main_~i~0 0)} is VALID [2018-11-18 22:50:22,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {3560#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3560#(= main_~i~0 0)} is VALID [2018-11-18 22:50:22,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {3560#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3560#(= main_~i~0 0)} is VALID [2018-11-18 22:50:22,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {3560#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {3561#(<= main_~i~0 1)} assume true; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {3561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {3561#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:22,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {3561#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:22,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {3562#(<= main_~i~0 2)} assume true; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:22,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {3562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:22,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {3562#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:22,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {3562#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:22,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {3563#(<= main_~i~0 3)} assume true; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:22,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {3563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:22,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {3563#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:22,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {3563#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:22,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {3564#(<= main_~i~0 4)} assume true; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:22,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {3564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:22,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {3564#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:22,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {3564#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:22,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {3565#(<= main_~i~0 5)} assume true; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:22,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {3565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:22,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {3565#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:22,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {3565#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:22,903 INFO L273 TraceCheckUtils]: 30: Hoare triple {3566#(<= main_~i~0 6)} assume true; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:22,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {3566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:22,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {3566#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:22,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {3566#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:22,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {3567#(<= main_~i~0 7)} assume true; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:22,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {3567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:22,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {3567#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:22,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {3567#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:22,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {3568#(<= main_~i~0 8)} assume true; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:22,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {3568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:22,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {3568#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:22,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {3568#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:22,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {3569#(<= main_~i~0 9)} assume true; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:22,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {3569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:22,913 INFO L273 TraceCheckUtils]: 44: Hoare triple {3569#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:22,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {3569#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3570#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:22,914 INFO L273 TraceCheckUtils]: 46: Hoare triple {3570#(<= main_~i~0 10)} assume true; {3570#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:22,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {3570#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3559#false} is VALID [2018-11-18 22:50:22,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {3559#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3559#false} is VALID [2018-11-18 22:50:22,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {3559#false} assume true; {3559#false} is VALID [2018-11-18 22:50:22,916 INFO L273 TraceCheckUtils]: 50: Hoare triple {3559#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3559#false} is VALID [2018-11-18 22:50:22,917 INFO L256 TraceCheckUtils]: 51: Hoare triple {3559#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3558#true} is VALID [2018-11-18 22:50:22,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {3558#true} ~cond := #in~cond; {3558#true} is VALID [2018-11-18 22:50:22,917 INFO L273 TraceCheckUtils]: 53: Hoare triple {3558#true} assume !(0 == ~cond); {3558#true} is VALID [2018-11-18 22:50:22,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {3558#true} assume true; {3558#true} is VALID [2018-11-18 22:50:22,918 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3558#true} {3559#false} #66#return; {3559#false} is VALID [2018-11-18 22:50:22,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {3559#false} havoc #t~mem4;havoc #t~mem3; {3559#false} is VALID [2018-11-18 22:50:22,919 INFO L273 TraceCheckUtils]: 57: Hoare triple {3559#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3559#false} is VALID [2018-11-18 22:50:22,919 INFO L273 TraceCheckUtils]: 58: Hoare triple {3559#false} assume true; {3559#false} is VALID [2018-11-18 22:50:22,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {3559#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3559#false} is VALID [2018-11-18 22:50:22,919 INFO L256 TraceCheckUtils]: 60: Hoare triple {3559#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3559#false} is VALID [2018-11-18 22:50:22,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {3559#false} ~cond := #in~cond; {3559#false} is VALID [2018-11-18 22:50:22,920 INFO L273 TraceCheckUtils]: 62: Hoare triple {3559#false} assume 0 == ~cond; {3559#false} is VALID [2018-11-18 22:50:22,920 INFO L273 TraceCheckUtils]: 63: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2018-11-18 22:50:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:50:22,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:22,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:50:22,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:23,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:23,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3558#true} is VALID [2018-11-18 22:50:23,150 INFO L273 TraceCheckUtils]: 1: Hoare triple {3558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3558#true} is VALID [2018-11-18 22:50:23,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2018-11-18 22:50:23,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #62#return; {3558#true} is VALID [2018-11-18 22:50:23,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret5 := main(); {3558#true} is VALID [2018-11-18 22:50:23,152 INFO L273 TraceCheckUtils]: 5: Hoare triple {3558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {3589#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {3589#(<= main_~i~0 0)} assume true; {3589#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {3589#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3589#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {3589#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3589#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:23,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {3589#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {3561#(<= main_~i~0 1)} assume true; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {3561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {3561#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3561#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:23,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {3561#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {3562#(<= main_~i~0 2)} assume true; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {3562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {3562#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3562#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:23,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {3562#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:23,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {3563#(<= main_~i~0 3)} assume true; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:23,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {3563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:23,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {3563#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3563#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:23,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {3563#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:23,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {3564#(<= main_~i~0 4)} assume true; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:23,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {3564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:23,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {3564#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3564#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:23,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {3564#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:23,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {3565#(<= main_~i~0 5)} assume true; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:23,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {3565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:23,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {3565#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3565#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:23,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {3565#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:23,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {3566#(<= main_~i~0 6)} assume true; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:23,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {3566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:23,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {3566#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3566#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:23,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {3566#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:23,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {3567#(<= main_~i~0 7)} assume true; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:23,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {3567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:23,202 INFO L273 TraceCheckUtils]: 36: Hoare triple {3567#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3567#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:23,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {3567#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:23,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {3568#(<= main_~i~0 8)} assume true; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:23,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {3568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:23,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {3568#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3568#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:23,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {3568#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:23,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {3569#(<= main_~i~0 9)} assume true; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:23,270 INFO L273 TraceCheckUtils]: 43: Hoare triple {3569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:23,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {3569#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {3569#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:23,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {3569#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3570#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:23,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {3570#(<= main_~i~0 10)} assume true; {3570#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:23,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {3570#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3559#false} is VALID [2018-11-18 22:50:23,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {3559#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {3559#false} is VALID [2018-11-18 22:50:23,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {3559#false} assume true; {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {3559#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L256 TraceCheckUtils]: 51: Hoare triple {3559#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {3559#false} ~cond := #in~cond; {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {3559#false} assume !(0 == ~cond); {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {3559#false} assume true; {3559#false} is VALID [2018-11-18 22:50:23,283 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3559#false} {3559#false} #66#return; {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L273 TraceCheckUtils]: 56: Hoare triple {3559#false} havoc #t~mem4;havoc #t~mem3; {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {3559#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {3559#false} assume true; {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {3559#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L256 TraceCheckUtils]: 60: Hoare triple {3559#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3559#false} is VALID [2018-11-18 22:50:23,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {3559#false} ~cond := #in~cond; {3559#false} is VALID [2018-11-18 22:50:23,285 INFO L273 TraceCheckUtils]: 62: Hoare triple {3559#false} assume 0 == ~cond; {3559#false} is VALID [2018-11-18 22:50:23,285 INFO L273 TraceCheckUtils]: 63: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2018-11-18 22:50:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 22:50:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:50:23,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-11-18 22:50:23,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:23,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:50:23,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:23,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:50:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:50:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:50:23,382 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2018-11-18 22:50:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,644 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-18 22:50:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:50:23,645 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-11-18 22:50:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:50:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2018-11-18 22:50:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:50:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2018-11-18 22:50:23,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 80 transitions. [2018-11-18 22:50:23,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:23,746 INFO L225 Difference]: With dead ends: 92 [2018-11-18 22:50:23,746 INFO L226 Difference]: Without dead ends: 73 [2018-11-18 22:50:23,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:50:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-18 22:50:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-18 22:50:23,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:23,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 71 states. [2018-11-18 22:50:23,820 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 71 states. [2018-11-18 22:50:23,820 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 71 states. [2018-11-18 22:50:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,823 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-18 22:50:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-18 22:50:23,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:23,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:23,824 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 73 states. [2018-11-18 22:50:23,824 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 73 states. [2018-11-18 22:50:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:23,826 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-18 22:50:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-18 22:50:23,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:23,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:23,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:23,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 22:50:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-11-18 22:50:23,829 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 64 [2018-11-18 22:50:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:23,829 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-18 22:50:23,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:50:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-18 22:50:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 22:50:23,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:23,830 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:23,831 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:23,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 57699051, now seen corresponding path program 2 times [2018-11-18 22:50:23,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:50:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:24,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {4122#true} call ULTIMATE.init(); {4122#true} is VALID [2018-11-18 22:50:24,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {4122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4122#true} is VALID [2018-11-18 22:50:24,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {4122#true} assume true; {4122#true} is VALID [2018-11-18 22:50:24,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4122#true} {4122#true} #62#return; {4122#true} is VALID [2018-11-18 22:50:24,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {4122#true} call #t~ret5 := main(); {4122#true} is VALID [2018-11-18 22:50:24,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {4122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4124#(= main_~i~0 0)} is VALID [2018-11-18 22:50:24,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#(= main_~i~0 0)} assume true; {4124#(= main_~i~0 0)} is VALID [2018-11-18 22:50:24,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4124#(= main_~i~0 0)} is VALID [2018-11-18 22:50:24,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4124#(= main_~i~0 0)} is VALID [2018-11-18 22:50:24,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {4125#(<= main_~i~0 1)} assume true; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {4125#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {4125#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {4125#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {4126#(<= main_~i~0 2)} assume true; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {4126#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {4126#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {4126#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {4127#(<= main_~i~0 3)} assume true; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {4127#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {4127#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {4127#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {4128#(<= main_~i~0 4)} assume true; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {4128#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {4128#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {4128#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {4129#(<= main_~i~0 5)} assume true; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {4129#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {4129#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {4129#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {4130#(<= main_~i~0 6)} assume true; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {4130#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {4130#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,043 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {4131#(<= main_~i~0 7)} assume true; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {4131#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {4132#(<= main_~i~0 8)} assume true; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,046 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,048 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 9)} assume true; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,048 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {4133#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,050 INFO L273 TraceCheckUtils]: 46: Hoare triple {4134#(<= main_~i~0 10)} assume true; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,051 INFO L273 TraceCheckUtils]: 47: Hoare triple {4134#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {4134#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,052 INFO L273 TraceCheckUtils]: 49: Hoare triple {4134#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4135#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:24,053 INFO L273 TraceCheckUtils]: 50: Hoare triple {4135#(<= main_~i~0 11)} assume true; {4135#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:24,053 INFO L273 TraceCheckUtils]: 51: Hoare triple {4135#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4123#false} is VALID [2018-11-18 22:50:24,053 INFO L273 TraceCheckUtils]: 52: Hoare triple {4123#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4123#false} is VALID [2018-11-18 22:50:24,054 INFO L273 TraceCheckUtils]: 53: Hoare triple {4123#false} assume true; {4123#false} is VALID [2018-11-18 22:50:24,054 INFO L273 TraceCheckUtils]: 54: Hoare triple {4123#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4123#false} is VALID [2018-11-18 22:50:24,054 INFO L256 TraceCheckUtils]: 55: Hoare triple {4123#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4122#true} is VALID [2018-11-18 22:50:24,054 INFO L273 TraceCheckUtils]: 56: Hoare triple {4122#true} ~cond := #in~cond; {4122#true} is VALID [2018-11-18 22:50:24,054 INFO L273 TraceCheckUtils]: 57: Hoare triple {4122#true} assume !(0 == ~cond); {4122#true} is VALID [2018-11-18 22:50:24,055 INFO L273 TraceCheckUtils]: 58: Hoare triple {4122#true} assume true; {4122#true} is VALID [2018-11-18 22:50:24,055 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {4122#true} {4123#false} #66#return; {4123#false} is VALID [2018-11-18 22:50:24,055 INFO L273 TraceCheckUtils]: 60: Hoare triple {4123#false} havoc #t~mem4;havoc #t~mem3; {4123#false} is VALID [2018-11-18 22:50:24,055 INFO L273 TraceCheckUtils]: 61: Hoare triple {4123#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4123#false} is VALID [2018-11-18 22:50:24,056 INFO L273 TraceCheckUtils]: 62: Hoare triple {4123#false} assume true; {4123#false} is VALID [2018-11-18 22:50:24,056 INFO L273 TraceCheckUtils]: 63: Hoare triple {4123#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4123#false} is VALID [2018-11-18 22:50:24,056 INFO L256 TraceCheckUtils]: 64: Hoare triple {4123#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4123#false} is VALID [2018-11-18 22:50:24,056 INFO L273 TraceCheckUtils]: 65: Hoare triple {4123#false} ~cond := #in~cond; {4123#false} is VALID [2018-11-18 22:50:24,056 INFO L273 TraceCheckUtils]: 66: Hoare triple {4123#false} assume 0 == ~cond; {4123#false} is VALID [2018-11-18 22:50:24,057 INFO L273 TraceCheckUtils]: 67: Hoare triple {4123#false} assume !false; {4123#false} is VALID [2018-11-18 22:50:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:50:24,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:24,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:50:24,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:50:24,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:50:24,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:24,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:24,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {4122#true} call ULTIMATE.init(); {4122#true} is VALID [2018-11-18 22:50:24,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {4122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4122#true} is VALID [2018-11-18 22:50:24,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {4122#true} assume true; {4122#true} is VALID [2018-11-18 22:50:24,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4122#true} {4122#true} #62#return; {4122#true} is VALID [2018-11-18 22:50:24,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {4122#true} call #t~ret5 := main(); {4122#true} is VALID [2018-11-18 22:50:24,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {4122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4154#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:24,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {4154#(<= main_~i~0 0)} assume true; {4154#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:24,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {4154#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:24,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {4154#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4154#(<= main_~i~0 0)} is VALID [2018-11-18 22:50:24,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {4154#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {4125#(<= main_~i~0 1)} assume true; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {4125#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {4125#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4125#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:24,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {4125#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {4126#(<= main_~i~0 2)} assume true; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {4126#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {4126#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4126#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:24,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {4126#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {4127#(<= main_~i~0 3)} assume true; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {4127#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {4127#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4127#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:24,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {4127#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {4128#(<= main_~i~0 4)} assume true; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {4128#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,302 INFO L273 TraceCheckUtils]: 24: Hoare triple {4128#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4128#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:24,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {4128#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {4129#(<= main_~i~0 5)} assume true; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {4129#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {4129#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4129#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:24,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {4129#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {4130#(<= main_~i~0 6)} assume true; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {4130#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {4130#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4130#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:24,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,308 INFO L273 TraceCheckUtils]: 34: Hoare triple {4131#(<= main_~i~0 7)} assume true; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {4131#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4131#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:24,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {4132#(<= main_~i~0 8)} assume true; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4132#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:24,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,313 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 9)} assume true; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4133#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:24,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {4133#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {4134#(<= main_~i~0 10)} assume true; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {4134#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {4134#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4134#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:24,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {4134#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4135#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:24,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {4135#(<= main_~i~0 11)} assume true; {4135#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:24,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {4135#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4123#false} is VALID [2018-11-18 22:50:24,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {4123#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4123#false} is VALID [2018-11-18 22:50:24,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {4123#false} assume true; {4123#false} is VALID [2018-11-18 22:50:24,319 INFO L273 TraceCheckUtils]: 54: Hoare triple {4123#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4123#false} is VALID [2018-11-18 22:50:24,319 INFO L256 TraceCheckUtils]: 55: Hoare triple {4123#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4123#false} is VALID [2018-11-18 22:50:24,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {4123#false} ~cond := #in~cond; {4123#false} is VALID [2018-11-18 22:50:24,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {4123#false} assume !(0 == ~cond); {4123#false} is VALID [2018-11-18 22:50:24,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {4123#false} assume true; {4123#false} is VALID [2018-11-18 22:50:24,320 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {4123#false} {4123#false} #66#return; {4123#false} is VALID [2018-11-18 22:50:24,320 INFO L273 TraceCheckUtils]: 60: Hoare triple {4123#false} havoc #t~mem4;havoc #t~mem3; {4123#false} is VALID [2018-11-18 22:50:24,320 INFO L273 TraceCheckUtils]: 61: Hoare triple {4123#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4123#false} is VALID [2018-11-18 22:50:24,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {4123#false} assume true; {4123#false} is VALID [2018-11-18 22:50:24,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {4123#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4123#false} is VALID [2018-11-18 22:50:24,321 INFO L256 TraceCheckUtils]: 64: Hoare triple {4123#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4123#false} is VALID [2018-11-18 22:50:24,321 INFO L273 TraceCheckUtils]: 65: Hoare triple {4123#false} ~cond := #in~cond; {4123#false} is VALID [2018-11-18 22:50:24,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {4123#false} assume 0 == ~cond; {4123#false} is VALID [2018-11-18 22:50:24,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {4123#false} assume !false; {4123#false} is VALID [2018-11-18 22:50:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 22:50:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:50:24,343 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-11-18 22:50:24,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:24,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:50:24,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:24,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:50:24,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:50:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:50:24,409 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 15 states. [2018-11-18 22:50:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:24,674 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-18 22:50:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:50:24,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-11-18 22:50:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:50:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:50:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-18 22:50:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:50:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-18 22:50:24,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 84 transitions. [2018-11-18 22:50:25,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:25,071 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:50:25,071 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 22:50:25,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:50:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 22:50:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-18 22:50:25,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:50:25,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-18 22:50:25,634 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-18 22:50:25,634 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-18 22:50:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:25,636 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-18 22:50:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-18 22:50:25,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:25,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:25,637 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-18 22:50:25,637 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-18 22:50:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:50:25,639 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-18 22:50:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-18 22:50:25,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:50:25,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:50:25,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:50:25,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:50:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 22:50:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-18 22:50:25,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 68 [2018-11-18 22:50:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:50:25,642 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-18 22:50:25,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:50:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-18 22:50:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 22:50:25,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:50:25,643 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:50:25,643 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:50:25,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:50:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 281918355, now seen corresponding path program 3 times [2018-11-18 22:50:25,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:50:25,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:50:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:25,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:50:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:50:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:25,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {4717#true} call ULTIMATE.init(); {4717#true} is VALID [2018-11-18 22:50:25,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {4717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4717#true} is VALID [2018-11-18 22:50:25,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {4717#true} assume true; {4717#true} is VALID [2018-11-18 22:50:25,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4717#true} {4717#true} #62#return; {4717#true} is VALID [2018-11-18 22:50:25,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {4717#true} call #t~ret5 := main(); {4717#true} is VALID [2018-11-18 22:50:25,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {4717#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4719#(= main_~i~0 0)} is VALID [2018-11-18 22:50:25,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {4719#(= main_~i~0 0)} assume true; {4719#(= main_~i~0 0)} is VALID [2018-11-18 22:50:25,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {4719#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4719#(= main_~i~0 0)} is VALID [2018-11-18 22:50:25,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {4719#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4719#(= main_~i~0 0)} is VALID [2018-11-18 22:50:25,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {4719#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4720#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:25,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {4720#(<= main_~i~0 1)} assume true; {4720#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:25,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {4720#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4720#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:25,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {4720#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4720#(<= main_~i~0 1)} is VALID [2018-11-18 22:50:25,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {4720#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4721#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:25,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {4721#(<= main_~i~0 2)} assume true; {4721#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:25,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {4721#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4721#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:25,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {4721#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4721#(<= main_~i~0 2)} is VALID [2018-11-18 22:50:25,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {4721#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4722#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:25,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {4722#(<= main_~i~0 3)} assume true; {4722#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:25,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {4722#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4722#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:25,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {4722#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4722#(<= main_~i~0 3)} is VALID [2018-11-18 22:50:25,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {4722#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4723#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:25,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {4723#(<= main_~i~0 4)} assume true; {4723#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:25,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {4723#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4723#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:25,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {4723#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4723#(<= main_~i~0 4)} is VALID [2018-11-18 22:50:25,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {4723#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4724#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:25,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {4724#(<= main_~i~0 5)} assume true; {4724#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:25,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {4724#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4724#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:25,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {4724#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4724#(<= main_~i~0 5)} is VALID [2018-11-18 22:50:25,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {4724#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4725#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:25,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {4725#(<= main_~i~0 6)} assume true; {4725#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:25,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {4725#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4725#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:25,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {4725#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4725#(<= main_~i~0 6)} is VALID [2018-11-18 22:50:25,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {4725#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4726#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:25,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {4726#(<= main_~i~0 7)} assume true; {4726#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:25,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {4726#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4726#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:25,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {4726#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4726#(<= main_~i~0 7)} is VALID [2018-11-18 22:50:25,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {4726#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4727#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:25,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {4727#(<= main_~i~0 8)} assume true; {4727#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:25,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {4727#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4727#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:25,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {4727#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4727#(<= main_~i~0 8)} is VALID [2018-11-18 22:50:25,897 INFO L273 TraceCheckUtils]: 41: Hoare triple {4727#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4728#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:25,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {4728#(<= main_~i~0 9)} assume true; {4728#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:25,898 INFO L273 TraceCheckUtils]: 43: Hoare triple {4728#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4728#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:25,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {4728#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4728#(<= main_~i~0 9)} is VALID [2018-11-18 22:50:25,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {4728#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4729#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:25,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {4729#(<= main_~i~0 10)} assume true; {4729#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:25,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {4729#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4729#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:25,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {4729#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4729#(<= main_~i~0 10)} is VALID [2018-11-18 22:50:25,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {4729#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4730#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:25,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {4730#(<= main_~i~0 11)} assume true; {4730#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:25,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {4730#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4730#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:25,904 INFO L273 TraceCheckUtils]: 52: Hoare triple {4730#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4730#(<= main_~i~0 11)} is VALID [2018-11-18 22:50:25,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {4730#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4731#(<= main_~i~0 12)} is VALID [2018-11-18 22:50:25,905 INFO L273 TraceCheckUtils]: 54: Hoare triple {4731#(<= main_~i~0 12)} assume true; {4731#(<= main_~i~0 12)} is VALID [2018-11-18 22:50:25,905 INFO L273 TraceCheckUtils]: 55: Hoare triple {4731#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4718#false} is VALID [2018-11-18 22:50:25,906 INFO L273 TraceCheckUtils]: 56: Hoare triple {4718#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4718#false} is VALID [2018-11-18 22:50:25,906 INFO L273 TraceCheckUtils]: 57: Hoare triple {4718#false} assume true; {4718#false} is VALID [2018-11-18 22:50:25,906 INFO L273 TraceCheckUtils]: 58: Hoare triple {4718#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4718#false} is VALID [2018-11-18 22:50:25,906 INFO L256 TraceCheckUtils]: 59: Hoare triple {4718#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4717#true} is VALID [2018-11-18 22:50:25,907 INFO L273 TraceCheckUtils]: 60: Hoare triple {4717#true} ~cond := #in~cond; {4717#true} is VALID [2018-11-18 22:50:25,907 INFO L273 TraceCheckUtils]: 61: Hoare triple {4717#true} assume !(0 == ~cond); {4717#true} is VALID [2018-11-18 22:50:25,907 INFO L273 TraceCheckUtils]: 62: Hoare triple {4717#true} assume true; {4717#true} is VALID [2018-11-18 22:50:25,907 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4717#true} {4718#false} #66#return; {4718#false} is VALID [2018-11-18 22:50:25,907 INFO L273 TraceCheckUtils]: 64: Hoare triple {4718#false} havoc #t~mem4;havoc #t~mem3; {4718#false} is VALID [2018-11-18 22:50:25,908 INFO L273 TraceCheckUtils]: 65: Hoare triple {4718#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4718#false} is VALID [2018-11-18 22:50:25,908 INFO L273 TraceCheckUtils]: 66: Hoare triple {4718#false} assume true; {4718#false} is VALID [2018-11-18 22:50:25,908 INFO L273 TraceCheckUtils]: 67: Hoare triple {4718#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4718#false} is VALID [2018-11-18 22:50:25,908 INFO L256 TraceCheckUtils]: 68: Hoare triple {4718#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4718#false} is VALID [2018-11-18 22:50:25,908 INFO L273 TraceCheckUtils]: 69: Hoare triple {4718#false} ~cond := #in~cond; {4718#false} is VALID [2018-11-18 22:50:25,909 INFO L273 TraceCheckUtils]: 70: Hoare triple {4718#false} assume 0 == ~cond; {4718#false} is VALID [2018-11-18 22:50:25,909 INFO L273 TraceCheckUtils]: 71: Hoare triple {4718#false} assume !false; {4718#false} is VALID [2018-11-18 22:50:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:50:25,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:50:25,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:50:25,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:50:25,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-18 22:50:25,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:50:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:50:25,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:50:26,055 INFO L477 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-18 22:50:26,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:26,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-18 22:50:28,603 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)))) is different from true [2018-11-18 22:50:28,718 INFO L477 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 26 treesize of output 22 [2018-11-18 22:50:28,728 INFO L477 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 13 treesize of output 5 [2018-11-18 22:50:28,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:28,737 INFO L477 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 11 treesize of output 3 [2018-11-18 22:50:28,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:50:28,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:28,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:50:28,747 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-18 22:50:28,750 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:50:28,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {4717#true} call ULTIMATE.init(); {4717#true} is VALID [2018-11-18 22:50:28,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {4717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4717#true} is VALID [2018-11-18 22:50:28,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {4717#true} assume true; {4717#true} is VALID [2018-11-18 22:50:28,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4717#true} {4717#true} #62#return; {4717#true} is VALID [2018-11-18 22:50:28,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {4717#true} call #t~ret5 := main(); {4717#true} is VALID [2018-11-18 22:50:28,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {4717#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {4750#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4763#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {4763#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4763#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {4763#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4770#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {4770#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) |main_#t~mem1|) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,860 INFO L273 TraceCheckUtils]: 37: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,869 INFO L273 TraceCheckUtils]: 47: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,871 INFO L273 TraceCheckUtils]: 50: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,872 INFO L273 TraceCheckUtils]: 51: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,873 INFO L273 TraceCheckUtils]: 52: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,874 INFO L273 TraceCheckUtils]: 53: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,877 INFO L273 TraceCheckUtils]: 56: Hoare triple {4774#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,880 INFO L256 TraceCheckUtils]: 59: Hoare triple {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-18 22:50:28,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-18 22:50:28,882 INFO L273 TraceCheckUtils]: 61: Hoare triple {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} assume !(0 == ~cond); {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-18 22:50:28,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} assume true; {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-18 22:50:28,884 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4917#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|))))} {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #66#return; {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,884 INFO L273 TraceCheckUtils]: 64: Hoare triple {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {4907#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {4936#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,886 INFO L273 TraceCheckUtils]: 66: Hoare triple {4936#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {4936#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:50:28,888 INFO L273 TraceCheckUtils]: 67: Hoare triple {4936#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4943#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-18 22:50:28,889 INFO L256 TraceCheckUtils]: 68: Hoare triple {4943#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4947#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 22:50:28,889 INFO L273 TraceCheckUtils]: 69: Hoare triple {4947#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4951#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:50:28,890 INFO L273 TraceCheckUtils]: 70: Hoare triple {4951#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4718#false} is VALID [2018-11-18 22:50:28,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {4718#false} assume !false; {4718#false} is VALID [2018-11-18 22:50:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 210 trivial. 2 not checked. [2018-11-18 22:50:28,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:50:28,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-11-18 22:50:28,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-11-18 22:50:28,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:50:28,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:50:29,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:50:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:50:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:50:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=405, Unknown=1, NotChecked=44, Total=600 [2018-11-18 22:50:29,042 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 25 states. [2018-11-18 22:50:54,138 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:51:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:24,068 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-11-18 22:51:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:51:24,068 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-11-18 22:51:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:51:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2018-11-18 22:51:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:51:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2018-11-18 22:51:24,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 107 transitions. [2018-11-18 22:51:24,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:24,278 INFO L225 Difference]: With dead ends: 111 [2018-11-18 22:51:24,279 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 22:51:24,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=359, Invalid=1204, Unknown=1, NotChecked=76, Total=1640 [2018-11-18 22:51:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 22:51:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-18 22:51:24,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:24,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 88 states. [2018-11-18 22:51:24,546 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 88 states. [2018-11-18 22:51:24,546 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 88 states. [2018-11-18 22:51:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:24,548 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-11-18 22:51:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-18 22:51:24,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:24,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:24,549 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 92 states. [2018-11-18 22:51:24,549 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 92 states. [2018-11-18 22:51:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:24,552 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-11-18 22:51:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-18 22:51:24,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:24,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:24,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:24,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 22:51:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-18 22:51:24,556 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 72 [2018-11-18 22:51:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:24,556 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-18 22:51:24,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:51:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-18 22:51:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 22:51:24,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:24,558 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:24,558 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:24,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1200814303, now seen corresponding path program 4 times [2018-11-18 22:51:24,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:24,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:24,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:25,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {5432#true} call ULTIMATE.init(); {5432#true} is VALID [2018-11-18 22:51:25,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {5432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5432#true} is VALID [2018-11-18 22:51:25,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {5432#true} assume true; {5432#true} is VALID [2018-11-18 22:51:25,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5432#true} {5432#true} #62#return; {5432#true} is VALID [2018-11-18 22:51:25,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {5432#true} call #t~ret5 := main(); {5432#true} is VALID [2018-11-18 22:51:25,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {5432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {5434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:25,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {5434#(= main_~i~0 0)} assume true; {5434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:25,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {5434#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:25,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {5434#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:25,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {5434#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {5435#(<= main_~i~0 1)} assume true; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {5435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {5435#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {5435#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {5436#(<= main_~i~0 2)} assume true; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {5436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {5436#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {5436#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {5437#(<= main_~i~0 3)} assume true; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {5437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {5437#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {5437#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {5438#(<= main_~i~0 4)} assume true; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {5438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {5438#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {5438#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {5439#(<= main_~i~0 5)} assume true; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {5439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {5439#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {5439#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {5440#(<= main_~i~0 6)} assume true; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {5440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {5440#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {5441#(<= main_~i~0 7)} assume true; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {5441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {5441#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {5441#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {5442#(<= main_~i~0 8)} assume true; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {5442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {5442#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {5442#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,403 INFO L273 TraceCheckUtils]: 42: Hoare triple {5443#(<= main_~i~0 9)} assume true; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {5443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {5443#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,405 INFO L273 TraceCheckUtils]: 45: Hoare triple {5443#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {5444#(<= main_~i~0 10)} assume true; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {5444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {5444#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {5444#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {5445#(<= main_~i~0 11)} assume true; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {5445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {5445#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {5445#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {5446#(<= main_~i~0 12)} assume true; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {5446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {5446#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {5446#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:25,413 INFO L273 TraceCheckUtils]: 58: Hoare triple {5447#(<= main_~i~0 13)} assume true; {5447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:25,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {5447#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5433#false} is VALID [2018-11-18 22:51:25,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {5433#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {5433#false} is VALID [2018-11-18 22:51:25,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,415 INFO L256 TraceCheckUtils]: 63: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5432#true} is VALID [2018-11-18 22:51:25,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {5432#true} ~cond := #in~cond; {5432#true} is VALID [2018-11-18 22:51:25,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {5432#true} assume !(0 == ~cond); {5432#true} is VALID [2018-11-18 22:51:25,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {5432#true} assume true; {5432#true} is VALID [2018-11-18 22:51:25,415 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5432#true} {5433#false} #66#return; {5433#false} is VALID [2018-11-18 22:51:25,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {5433#false} havoc #t~mem4;havoc #t~mem3; {5433#false} is VALID [2018-11-18 22:51:25,416 INFO L273 TraceCheckUtils]: 69: Hoare triple {5433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5433#false} is VALID [2018-11-18 22:51:25,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,416 INFO L256 TraceCheckUtils]: 72: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5432#true} is VALID [2018-11-18 22:51:25,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {5432#true} ~cond := #in~cond; {5432#true} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {5432#true} assume !(0 == ~cond); {5432#true} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {5432#true} assume true; {5432#true} is VALID [2018-11-18 22:51:25,417 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5432#true} {5433#false} #66#return; {5433#false} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 77: Hoare triple {5433#false} havoc #t~mem4;havoc #t~mem3; {5433#false} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 78: Hoare triple {5433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5433#false} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 79: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,417 INFO L273 TraceCheckUtils]: 80: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,418 INFO L256 TraceCheckUtils]: 81: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5433#false} is VALID [2018-11-18 22:51:25,418 INFO L273 TraceCheckUtils]: 82: Hoare triple {5433#false} ~cond := #in~cond; {5433#false} is VALID [2018-11-18 22:51:25,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {5433#false} assume 0 == ~cond; {5433#false} is VALID [2018-11-18 22:51:25,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {5433#false} assume !false; {5433#false} is VALID [2018-11-18 22:51:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 4 proven. 338 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:25,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:25,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:51:25,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:51:25,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:25,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:25,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {5432#true} call ULTIMATE.init(); {5432#true} is VALID [2018-11-18 22:51:25,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {5432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5432#true} is VALID [2018-11-18 22:51:25,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {5432#true} assume true; {5432#true} is VALID [2018-11-18 22:51:25,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5432#true} {5432#true} #62#return; {5432#true} is VALID [2018-11-18 22:51:25,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {5432#true} call #t~ret5 := main(); {5432#true} is VALID [2018-11-18 22:51:25,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {5432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {5466#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:25,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {5466#(<= main_~i~0 0)} assume true; {5466#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:25,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {5466#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5466#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:25,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5466#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:25,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {5466#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {5435#(<= main_~i~0 1)} assume true; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {5435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {5435#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:25,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {5435#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {5436#(<= main_~i~0 2)} assume true; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {5436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {5436#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:25,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {5436#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {5437#(<= main_~i~0 3)} assume true; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {5437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {5437#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:25,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {5437#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {5438#(<= main_~i~0 4)} assume true; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {5438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {5438#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:25,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {5438#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {5439#(<= main_~i~0 5)} assume true; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,770 INFO L273 TraceCheckUtils]: 27: Hoare triple {5439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {5439#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:25,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {5439#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {5440#(<= main_~i~0 6)} assume true; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {5440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,773 INFO L273 TraceCheckUtils]: 32: Hoare triple {5440#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:25,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {5441#(<= main_~i~0 7)} assume true; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {5441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {5441#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:25,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {5441#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {5442#(<= main_~i~0 8)} assume true; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {5442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {5442#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:25,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {5442#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {5443#(<= main_~i~0 9)} assume true; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {5443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {5443#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:25,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {5443#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {5444#(<= main_~i~0 10)} assume true; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {5444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,782 INFO L273 TraceCheckUtils]: 48: Hoare triple {5444#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:25,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {5444#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {5445#(<= main_~i~0 11)} assume true; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {5445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {5445#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:25,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {5445#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {5446#(<= main_~i~0 12)} assume true; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,786 INFO L273 TraceCheckUtils]: 55: Hoare triple {5446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,787 INFO L273 TraceCheckUtils]: 56: Hoare triple {5446#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {5446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:25,788 INFO L273 TraceCheckUtils]: 57: Hoare triple {5446#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:25,788 INFO L273 TraceCheckUtils]: 58: Hoare triple {5447#(<= main_~i~0 13)} assume true; {5447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:25,789 INFO L273 TraceCheckUtils]: 59: Hoare triple {5447#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5433#false} is VALID [2018-11-18 22:51:25,789 INFO L273 TraceCheckUtils]: 60: Hoare triple {5433#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {5433#false} is VALID [2018-11-18 22:51:25,789 INFO L273 TraceCheckUtils]: 61: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,789 INFO L273 TraceCheckUtils]: 62: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,790 INFO L256 TraceCheckUtils]: 63: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5433#false} is VALID [2018-11-18 22:51:25,790 INFO L273 TraceCheckUtils]: 64: Hoare triple {5433#false} ~cond := #in~cond; {5433#false} is VALID [2018-11-18 22:51:25,790 INFO L273 TraceCheckUtils]: 65: Hoare triple {5433#false} assume !(0 == ~cond); {5433#false} is VALID [2018-11-18 22:51:25,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,790 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5433#false} {5433#false} #66#return; {5433#false} is VALID [2018-11-18 22:51:25,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {5433#false} havoc #t~mem4;havoc #t~mem3; {5433#false} is VALID [2018-11-18 22:51:25,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {5433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5433#false} is VALID [2018-11-18 22:51:25,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,791 INFO L273 TraceCheckUtils]: 71: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,791 INFO L256 TraceCheckUtils]: 72: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5433#false} is VALID [2018-11-18 22:51:25,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {5433#false} ~cond := #in~cond; {5433#false} is VALID [2018-11-18 22:51:25,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {5433#false} assume !(0 == ~cond); {5433#false} is VALID [2018-11-18 22:51:25,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,792 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5433#false} {5433#false} #66#return; {5433#false} is VALID [2018-11-18 22:51:25,792 INFO L273 TraceCheckUtils]: 77: Hoare triple {5433#false} havoc #t~mem4;havoc #t~mem3; {5433#false} is VALID [2018-11-18 22:51:25,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {5433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {5433#false} is VALID [2018-11-18 22:51:25,793 INFO L273 TraceCheckUtils]: 79: Hoare triple {5433#false} assume true; {5433#false} is VALID [2018-11-18 22:51:25,793 INFO L273 TraceCheckUtils]: 80: Hoare triple {5433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5433#false} is VALID [2018-11-18 22:51:25,793 INFO L256 TraceCheckUtils]: 81: Hoare triple {5433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5433#false} is VALID [2018-11-18 22:51:25,793 INFO L273 TraceCheckUtils]: 82: Hoare triple {5433#false} ~cond := #in~cond; {5433#false} is VALID [2018-11-18 22:51:25,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {5433#false} assume 0 == ~cond; {5433#false} is VALID [2018-11-18 22:51:25,794 INFO L273 TraceCheckUtils]: 84: Hoare triple {5433#false} assume !false; {5433#false} is VALID [2018-11-18 22:51:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:51:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:51:25,817 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-18 22:51:25,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:25,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:51:25,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:51:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:51:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:51:25,893 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2018-11-18 22:51:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:26,211 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-11-18 22:51:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:51:26,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-18 22:51:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:51:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-18 22:51:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:51:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-18 22:51:26,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 92 transitions. [2018-11-18 22:51:26,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:26,596 INFO L225 Difference]: With dead ends: 122 [2018-11-18 22:51:26,596 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 22:51:26,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 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-18 22:51:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 22:51:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-18 22:51:27,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:27,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-18 22:51:27,154 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-18 22:51:27,154 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-18 22:51:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:27,157 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-11-18 22:51:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-18 22:51:27,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:27,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:27,158 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-18 22:51:27,158 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-18 22:51:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:27,160 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-11-18 22:51:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-18 22:51:27,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:27,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:27,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:27,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:51:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-18 22:51:27,163 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 85 [2018-11-18 22:51:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:27,163 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-18 22:51:27,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:51:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-18 22:51:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 22:51:27,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:27,165 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:27,165 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:27,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 118889337, now seen corresponding path program 5 times [2018-11-18 22:51:27,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:27,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:27,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {6170#true} call ULTIMATE.init(); {6170#true} is VALID [2018-11-18 22:51:27,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {6170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6170#true} is VALID [2018-11-18 22:51:27,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-18 22:51:27,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6170#true} {6170#true} #62#return; {6170#true} is VALID [2018-11-18 22:51:27,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {6170#true} call #t~ret5 := main(); {6170#true} is VALID [2018-11-18 22:51:27,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {6170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {6172#(= main_~i~0 0)} is VALID [2018-11-18 22:51:27,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {6172#(= main_~i~0 0)} assume true; {6172#(= main_~i~0 0)} is VALID [2018-11-18 22:51:27,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {6172#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6172#(= main_~i~0 0)} is VALID [2018-11-18 22:51:27,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {6172#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6172#(= main_~i~0 0)} is VALID [2018-11-18 22:51:27,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {6172#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:27,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {6173#(<= main_~i~0 1)} assume true; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:27,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {6173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:27,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {6173#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:27,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {6173#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:27,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {6174#(<= main_~i~0 2)} assume true; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:27,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {6174#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:27,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {6174#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:27,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {6174#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:27,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {6175#(<= main_~i~0 3)} assume true; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:27,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {6175#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:27,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {6175#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:27,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {6175#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:27,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {6176#(<= main_~i~0 4)} assume true; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:27,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {6176#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:27,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {6176#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:27,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {6176#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:27,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {6177#(<= main_~i~0 5)} assume true; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:27,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {6177#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:27,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {6177#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:27,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {6177#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:27,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {6178#(<= main_~i~0 6)} assume true; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:27,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {6178#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:27,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {6178#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:27,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:27,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {6179#(<= main_~i~0 7)} assume true; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:27,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {6179#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:27,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:27,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:27,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {6180#(<= main_~i~0 8)} assume true; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:27,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:27,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:27,817 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:27,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 9)} assume true; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:27,820 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:27,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:27,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {6181#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:27,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 10)} assume true; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:27,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:27,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {6182#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:27,828 INFO L273 TraceCheckUtils]: 49: Hoare triple {6182#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:27,828 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 11)} assume true; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:27,830 INFO L273 TraceCheckUtils]: 51: Hoare triple {6183#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:27,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {6183#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:27,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {6183#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:27,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {6184#(<= main_~i~0 12)} assume true; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:27,834 INFO L273 TraceCheckUtils]: 55: Hoare triple {6184#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:27,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {6184#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:27,836 INFO L273 TraceCheckUtils]: 57: Hoare triple {6184#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:27,836 INFO L273 TraceCheckUtils]: 58: Hoare triple {6185#(<= main_~i~0 13)} assume true; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:27,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {6185#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:27,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {6185#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:27,841 INFO L273 TraceCheckUtils]: 61: Hoare triple {6185#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:27,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {6186#(<= main_~i~0 14)} assume true; {6186#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:27,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {6186#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {6171#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {6171#false} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:27,842 INFO L256 TraceCheckUtils]: 67: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6170#true} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {6170#true} ~cond := #in~cond; {6170#true} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {6170#true} assume !(0 == ~cond); {6170#true} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 70: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-18 22:51:27,842 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {6170#true} {6171#false} #66#return; {6171#false} is VALID [2018-11-18 22:51:27,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {6171#false} havoc #t~mem4;havoc #t~mem3; {6171#false} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {6171#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6171#false} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:27,843 INFO L256 TraceCheckUtils]: 76: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6170#true} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {6170#true} ~cond := #in~cond; {6170#true} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 78: Hoare triple {6170#true} assume !(0 == ~cond); {6170#true} is VALID [2018-11-18 22:51:27,843 INFO L273 TraceCheckUtils]: 79: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-18 22:51:27,843 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {6170#true} {6171#false} #66#return; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 81: Hoare triple {6171#false} havoc #t~mem4;havoc #t~mem3; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 82: Hoare triple {6171#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L256 TraceCheckUtils]: 85: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 87: Hoare triple {6171#false} assume 0 == ~cond; {6171#false} is VALID [2018-11-18 22:51:27,844 INFO L273 TraceCheckUtils]: 88: Hoare triple {6171#false} assume !false; {6171#false} is VALID [2018-11-18 22:51:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 4 proven. 392 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:27,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:27,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:51:27,912 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-18 22:51:27,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:27,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:28,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {6170#true} call ULTIMATE.init(); {6170#true} is VALID [2018-11-18 22:51:28,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {6170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6170#true} is VALID [2018-11-18 22:51:28,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {6170#true} assume true; {6170#true} is VALID [2018-11-18 22:51:28,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6170#true} {6170#true} #62#return; {6170#true} is VALID [2018-11-18 22:51:28,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {6170#true} call #t~ret5 := main(); {6170#true} is VALID [2018-11-18 22:51:28,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {6170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {6205#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:28,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {6205#(<= main_~i~0 0)} assume true; {6205#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:28,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {6205#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6205#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:28,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {6205#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6205#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:28,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {6205#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:28,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {6173#(<= main_~i~0 1)} assume true; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:28,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {6173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:28,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {6173#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6173#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:28,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {6173#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:28,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {6174#(<= main_~i~0 2)} assume true; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:28,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {6174#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:28,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {6174#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6174#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:28,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {6174#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:28,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {6175#(<= main_~i~0 3)} assume true; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:28,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {6175#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:28,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6175#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6175#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:28,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {6175#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:28,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6176#(<= main_~i~0 4)} assume true; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:28,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {6176#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:28,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {6176#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6176#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:28,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {6176#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:28,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {6177#(<= main_~i~0 5)} assume true; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:28,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {6177#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:28,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {6177#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6177#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:28,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {6177#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:28,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {6178#(<= main_~i~0 6)} assume true; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:28,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {6178#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:28,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {6178#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6178#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:28,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:28,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {6179#(<= main_~i~0 7)} assume true; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:28,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {6179#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:28,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6179#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:28,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:28,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {6180#(<= main_~i~0 8)} assume true; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:28,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:28,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6180#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:28,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:28,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 9)} assume true; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:28,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:28,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6181#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:28,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {6181#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:28,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 10)} assume true; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:28,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:28,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {6182#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6182#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:28,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {6182#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:28,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 11)} assume true; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:28,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {6183#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:28,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {6183#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6183#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:28,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {6183#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:28,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {6184#(<= main_~i~0 12)} assume true; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:28,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {6184#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:28,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {6184#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6184#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:28,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {6184#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:28,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {6185#(<= main_~i~0 13)} assume true; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:28,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {6185#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:28,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {6185#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6185#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:28,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {6185#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:28,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {6186#(<= main_~i~0 14)} assume true; {6186#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:28,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {6186#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6171#false} is VALID [2018-11-18 22:51:28,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {6171#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {6171#false} is VALID [2018-11-18 22:51:28,280 INFO L273 TraceCheckUtils]: 65: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:28,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:28,281 INFO L256 TraceCheckUtils]: 67: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6171#false} is VALID [2018-11-18 22:51:28,281 INFO L273 TraceCheckUtils]: 68: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-18 22:51:28,281 INFO L273 TraceCheckUtils]: 69: Hoare triple {6171#false} assume !(0 == ~cond); {6171#false} is VALID [2018-11-18 22:51:28,282 INFO L273 TraceCheckUtils]: 70: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:28,282 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {6171#false} {6171#false} #66#return; {6171#false} is VALID [2018-11-18 22:51:28,282 INFO L273 TraceCheckUtils]: 72: Hoare triple {6171#false} havoc #t~mem4;havoc #t~mem3; {6171#false} is VALID [2018-11-18 22:51:28,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {6171#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6171#false} is VALID [2018-11-18 22:51:28,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L256 TraceCheckUtils]: 76: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 77: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 78: Hoare triple {6171#false} assume !(0 == ~cond); {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 79: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {6171#false} {6171#false} #66#return; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 81: Hoare triple {6171#false} havoc #t~mem4;havoc #t~mem3; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 82: Hoare triple {6171#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6171#false} is VALID [2018-11-18 22:51:28,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {6171#false} assume true; {6171#false} is VALID [2018-11-18 22:51:28,284 INFO L273 TraceCheckUtils]: 84: Hoare triple {6171#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6171#false} is VALID [2018-11-18 22:51:28,284 INFO L256 TraceCheckUtils]: 85: Hoare triple {6171#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6171#false} is VALID [2018-11-18 22:51:28,284 INFO L273 TraceCheckUtils]: 86: Hoare triple {6171#false} ~cond := #in~cond; {6171#false} is VALID [2018-11-18 22:51:28,284 INFO L273 TraceCheckUtils]: 87: Hoare triple {6171#false} assume 0 == ~cond; {6171#false} is VALID [2018-11-18 22:51:28,284 INFO L273 TraceCheckUtils]: 88: Hoare triple {6171#false} assume !false; {6171#false} is VALID [2018-11-18 22:51:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:51:28,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:28,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:51:28,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-11-18 22:51:28,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:28,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:51:28,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:28,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:51:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:51:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:51:28,389 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 18 states. [2018-11-18 22:51:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:28,876 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-18 22:51:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:51:28,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-11-18 22:51:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:51:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 96 transitions. [2018-11-18 22:51:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:51:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 96 transitions. [2018-11-18 22:51:28,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 96 transitions. [2018-11-18 22:51:29,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:29,273 INFO L225 Difference]: With dead ends: 126 [2018-11-18 22:51:29,273 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 22:51:29,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:51:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 22:51:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 22:51:29,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:29,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-18 22:51:29,390 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-18 22:51:29,390 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-18 22:51:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:29,393 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-18 22:51:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-11-18 22:51:29,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:29,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:29,394 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-18 22:51:29,394 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-18 22:51:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:29,396 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-18 22:51:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-11-18 22:51:29,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:29,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:29,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:29,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 22:51:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-18 22:51:29,399 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 89 [2018-11-18 22:51:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:29,400 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-18 22:51:29,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:51:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-18 22:51:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 22:51:29,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:29,401 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:29,401 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:29,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash -135445551, now seen corresponding path program 6 times [2018-11-18 22:51:29,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:29,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:29,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:30,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {6939#true} call ULTIMATE.init(); {6939#true} is VALID [2018-11-18 22:51:30,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {6939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6939#true} is VALID [2018-11-18 22:51:30,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {6939#true} assume true; {6939#true} is VALID [2018-11-18 22:51:30,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6939#true} {6939#true} #62#return; {6939#true} is VALID [2018-11-18 22:51:30,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {6939#true} call #t~ret5 := main(); {6939#true} is VALID [2018-11-18 22:51:30,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {6939#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {6941#(= main_~i~0 0)} is VALID [2018-11-18 22:51:30,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {6941#(= main_~i~0 0)} assume true; {6941#(= main_~i~0 0)} is VALID [2018-11-18 22:51:30,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {6941#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6941#(= main_~i~0 0)} is VALID [2018-11-18 22:51:30,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {6941#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6941#(= main_~i~0 0)} is VALID [2018-11-18 22:51:30,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {6941#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {6942#(<= main_~i~0 1)} assume true; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {6942#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {6942#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {6942#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {6943#(<= main_~i~0 2)} assume true; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {6943#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {6943#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {6943#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {6944#(<= main_~i~0 3)} assume true; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {6944#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {6944#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {6944#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {6945#(<= main_~i~0 4)} assume true; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {6945#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {6945#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {6945#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {6946#(<= main_~i~0 5)} assume true; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {6946#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {6946#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {6946#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {6947#(<= main_~i~0 6)} assume true; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {6947#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {6947#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {6947#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {6948#(<= main_~i~0 7)} assume true; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {6948#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {6948#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {6948#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {6949#(<= main_~i~0 8)} assume true; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {6949#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {6949#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {6949#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {6950#(<= main_~i~0 9)} assume true; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {6950#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {6950#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {6950#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {6951#(<= main_~i~0 10)} assume true; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {6951#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {6951#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {6951#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,428 INFO L273 TraceCheckUtils]: 50: Hoare triple {6952#(<= main_~i~0 11)} assume true; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,429 INFO L273 TraceCheckUtils]: 51: Hoare triple {6952#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,429 INFO L273 TraceCheckUtils]: 52: Hoare triple {6952#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,430 INFO L273 TraceCheckUtils]: 53: Hoare triple {6952#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,430 INFO L273 TraceCheckUtils]: 54: Hoare triple {6953#(<= main_~i~0 12)} assume true; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,431 INFO L273 TraceCheckUtils]: 55: Hoare triple {6953#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,431 INFO L273 TraceCheckUtils]: 56: Hoare triple {6953#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,432 INFO L273 TraceCheckUtils]: 57: Hoare triple {6953#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,433 INFO L273 TraceCheckUtils]: 58: Hoare triple {6954#(<= main_~i~0 13)} assume true; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,433 INFO L273 TraceCheckUtils]: 59: Hoare triple {6954#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,434 INFO L273 TraceCheckUtils]: 60: Hoare triple {6954#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,435 INFO L273 TraceCheckUtils]: 61: Hoare triple {6954#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,435 INFO L273 TraceCheckUtils]: 62: Hoare triple {6955#(<= main_~i~0 14)} assume true; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,436 INFO L273 TraceCheckUtils]: 63: Hoare triple {6955#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,436 INFO L273 TraceCheckUtils]: 64: Hoare triple {6955#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,437 INFO L273 TraceCheckUtils]: 65: Hoare triple {6955#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6956#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:30,437 INFO L273 TraceCheckUtils]: 66: Hoare triple {6956#(<= main_~i~0 15)} assume true; {6956#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:30,438 INFO L273 TraceCheckUtils]: 67: Hoare triple {6956#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6940#false} is VALID [2018-11-18 22:51:30,438 INFO L273 TraceCheckUtils]: 68: Hoare triple {6940#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {6940#false} is VALID [2018-11-18 22:51:30,438 INFO L273 TraceCheckUtils]: 69: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,439 INFO L273 TraceCheckUtils]: 70: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,439 INFO L256 TraceCheckUtils]: 71: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6939#true} is VALID [2018-11-18 22:51:30,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {6939#true} ~cond := #in~cond; {6939#true} is VALID [2018-11-18 22:51:30,439 INFO L273 TraceCheckUtils]: 73: Hoare triple {6939#true} assume !(0 == ~cond); {6939#true} is VALID [2018-11-18 22:51:30,439 INFO L273 TraceCheckUtils]: 74: Hoare triple {6939#true} assume true; {6939#true} is VALID [2018-11-18 22:51:30,440 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6939#true} {6940#false} #66#return; {6940#false} is VALID [2018-11-18 22:51:30,440 INFO L273 TraceCheckUtils]: 76: Hoare triple {6940#false} havoc #t~mem4;havoc #t~mem3; {6940#false} is VALID [2018-11-18 22:51:30,440 INFO L273 TraceCheckUtils]: 77: Hoare triple {6940#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6940#false} is VALID [2018-11-18 22:51:30,440 INFO L273 TraceCheckUtils]: 78: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,440 INFO L273 TraceCheckUtils]: 79: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,441 INFO L256 TraceCheckUtils]: 80: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6939#true} is VALID [2018-11-18 22:51:30,441 INFO L273 TraceCheckUtils]: 81: Hoare triple {6939#true} ~cond := #in~cond; {6939#true} is VALID [2018-11-18 22:51:30,441 INFO L273 TraceCheckUtils]: 82: Hoare triple {6939#true} assume !(0 == ~cond); {6939#true} is VALID [2018-11-18 22:51:30,441 INFO L273 TraceCheckUtils]: 83: Hoare triple {6939#true} assume true; {6939#true} is VALID [2018-11-18 22:51:30,441 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {6939#true} {6940#false} #66#return; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 85: Hoare triple {6940#false} havoc #t~mem4;havoc #t~mem3; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 86: Hoare triple {6940#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 87: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 88: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L256 TraceCheckUtils]: 89: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 90: Hoare triple {6940#false} ~cond := #in~cond; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 91: Hoare triple {6940#false} assume 0 == ~cond; {6940#false} is VALID [2018-11-18 22:51:30,442 INFO L273 TraceCheckUtils]: 92: Hoare triple {6940#false} assume !false; {6940#false} is VALID [2018-11-18 22:51:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 4 proven. 450 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:30,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:30,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:30,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:51:30,503 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-18 22:51:30,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:30,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:30,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {6939#true} call ULTIMATE.init(); {6939#true} is VALID [2018-11-18 22:51:30,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {6939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6939#true} is VALID [2018-11-18 22:51:30,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {6939#true} assume true; {6939#true} is VALID [2018-11-18 22:51:30,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6939#true} {6939#true} #62#return; {6939#true} is VALID [2018-11-18 22:51:30,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {6939#true} call #t~ret5 := main(); {6939#true} is VALID [2018-11-18 22:51:30,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {6939#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {6975#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:30,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {6975#(<= main_~i~0 0)} assume true; {6975#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:30,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {6975#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6975#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:30,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {6975#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6975#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:30,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {6975#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {6942#(<= main_~i~0 1)} assume true; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {6942#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {6942#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6942#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:30,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {6942#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {6943#(<= main_~i~0 2)} assume true; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {6943#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {6943#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6943#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:30,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {6943#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {6944#(<= main_~i~0 3)} assume true; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {6944#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {6944#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6944#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:30,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {6944#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {6945#(<= main_~i~0 4)} assume true; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {6945#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {6945#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6945#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:30,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {6945#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {6946#(<= main_~i~0 5)} assume true; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,713 INFO L273 TraceCheckUtils]: 27: Hoare triple {6946#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {6946#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6946#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:30,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {6946#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {6947#(<= main_~i~0 6)} assume true; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {6947#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {6947#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6947#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:30,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {6947#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,718 INFO L273 TraceCheckUtils]: 34: Hoare triple {6948#(<= main_~i~0 7)} assume true; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,718 INFO L273 TraceCheckUtils]: 35: Hoare triple {6948#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {6948#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6948#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:30,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {6948#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {6949#(<= main_~i~0 8)} assume true; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,720 INFO L273 TraceCheckUtils]: 39: Hoare triple {6949#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {6949#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6949#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:30,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {6949#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {6950#(<= main_~i~0 9)} assume true; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,723 INFO L273 TraceCheckUtils]: 43: Hoare triple {6950#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,723 INFO L273 TraceCheckUtils]: 44: Hoare triple {6950#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6950#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:30,724 INFO L273 TraceCheckUtils]: 45: Hoare triple {6950#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {6951#(<= main_~i~0 10)} assume true; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,725 INFO L273 TraceCheckUtils]: 47: Hoare triple {6951#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,726 INFO L273 TraceCheckUtils]: 48: Hoare triple {6951#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6951#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:30,726 INFO L273 TraceCheckUtils]: 49: Hoare triple {6951#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {6952#(<= main_~i~0 11)} assume true; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {6952#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {6952#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6952#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:30,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {6952#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {6953#(<= main_~i~0 12)} assume true; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {6953#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {6953#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6953#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:30,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {6953#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {6954#(<= main_~i~0 13)} assume true; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {6954#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {6954#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6954#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:30,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {6954#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {6955#(<= main_~i~0 14)} assume true; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {6955#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {6955#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {6955#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:30,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {6955#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6956#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:30,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {6956#(<= main_~i~0 15)} assume true; {6956#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:30,737 INFO L273 TraceCheckUtils]: 67: Hoare triple {6956#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6940#false} is VALID [2018-11-18 22:51:30,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {6940#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {6940#false} is VALID [2018-11-18 22:51:30,737 INFO L273 TraceCheckUtils]: 69: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,738 INFO L256 TraceCheckUtils]: 71: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6940#false} is VALID [2018-11-18 22:51:30,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {6940#false} ~cond := #in~cond; {6940#false} is VALID [2018-11-18 22:51:30,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {6940#false} assume !(0 == ~cond); {6940#false} is VALID [2018-11-18 22:51:30,738 INFO L273 TraceCheckUtils]: 74: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,738 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6940#false} {6940#false} #66#return; {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 76: Hoare triple {6940#false} havoc #t~mem4;havoc #t~mem3; {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {6940#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 78: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 79: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L256 TraceCheckUtils]: 80: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 81: Hoare triple {6940#false} ~cond := #in~cond; {6940#false} is VALID [2018-11-18 22:51:30,739 INFO L273 TraceCheckUtils]: 82: Hoare triple {6940#false} assume !(0 == ~cond); {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 83: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {6940#false} {6940#false} #66#return; {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 85: Hoare triple {6940#false} havoc #t~mem4;havoc #t~mem3; {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 86: Hoare triple {6940#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 87: Hoare triple {6940#false} assume true; {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 88: Hoare triple {6940#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L256 TraceCheckUtils]: 89: Hoare triple {6940#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6940#false} is VALID [2018-11-18 22:51:30,740 INFO L273 TraceCheckUtils]: 90: Hoare triple {6940#false} ~cond := #in~cond; {6940#false} is VALID [2018-11-18 22:51:30,741 INFO L273 TraceCheckUtils]: 91: Hoare triple {6940#false} assume 0 == ~cond; {6940#false} is VALID [2018-11-18 22:51:30,741 INFO L273 TraceCheckUtils]: 92: Hoare triple {6940#false} assume !false; {6940#false} is VALID [2018-11-18 22:51:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:51:30,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:30,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:51:30,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-11-18 22:51:30,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:30,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:51:30,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:30,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:51:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:51:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:51:30,856 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 19 states. [2018-11-18 22:51:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:31,435 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-11-18 22:51:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:51:31,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-11-18 22:51:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:51:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 100 transitions. [2018-11-18 22:51:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:51:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 100 transitions. [2018-11-18 22:51:31,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 100 transitions. [2018-11-18 22:51:32,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:32,210 INFO L225 Difference]: With dead ends: 130 [2018-11-18 22:51:32,210 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 22:51:32,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:51:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 22:51:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-18 22:51:32,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:32,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-18 22:51:32,366 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-18 22:51:32,366 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-18 22:51:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:32,369 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-11-18 22:51:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-18 22:51:32,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:32,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:32,369 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-18 22:51:32,369 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-18 22:51:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:32,371 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-11-18 22:51:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-18 22:51:32,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:32,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:32,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:32,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 22:51:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-18 22:51:32,374 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 93 [2018-11-18 22:51:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:32,374 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-18 22:51:32,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:51:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-18 22:51:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 22:51:32,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:32,375 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:32,376 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:32,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -574062551, now seen corresponding path program 7 times [2018-11-18 22:51:32,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:32,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:32,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:32,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {7739#true} call ULTIMATE.init(); {7739#true} is VALID [2018-11-18 22:51:32,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {7739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7739#true} is VALID [2018-11-18 22:51:32,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {7739#true} assume true; {7739#true} is VALID [2018-11-18 22:51:32,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7739#true} {7739#true} #62#return; {7739#true} is VALID [2018-11-18 22:51:32,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {7739#true} call #t~ret5 := main(); {7739#true} is VALID [2018-11-18 22:51:32,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {7739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {7741#(= main_~i~0 0)} is VALID [2018-11-18 22:51:32,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {7741#(= main_~i~0 0)} assume true; {7741#(= main_~i~0 0)} is VALID [2018-11-18 22:51:32,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {7741#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7741#(= main_~i~0 0)} is VALID [2018-11-18 22:51:32,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {7741#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7741#(= main_~i~0 0)} is VALID [2018-11-18 22:51:32,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {7741#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:32,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {7742#(<= main_~i~0 1)} assume true; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:32,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {7742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:32,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {7742#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:32,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {7742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:32,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {7743#(<= main_~i~0 2)} assume true; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:32,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {7743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:32,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {7743#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:32,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {7743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:32,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {7744#(<= main_~i~0 3)} assume true; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:32,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {7744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:32,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {7744#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:32,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {7744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:32,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {7745#(<= main_~i~0 4)} assume true; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:32,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {7745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:32,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {7745#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:32,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {7745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:32,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {7746#(<= main_~i~0 5)} assume true; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:32,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {7746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:32,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {7746#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:32,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {7746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:32,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {7747#(<= main_~i~0 6)} assume true; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:32,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {7747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:32,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {7747#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:32,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {7747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:32,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {7748#(<= main_~i~0 7)} assume true; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:32,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {7748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:32,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {7748#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:32,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {7748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:32,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {7749#(<= main_~i~0 8)} assume true; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:32,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {7749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:32,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {7749#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:32,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {7749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:32,694 INFO L273 TraceCheckUtils]: 42: Hoare triple {7750#(<= main_~i~0 9)} assume true; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:32,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {7750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:32,695 INFO L273 TraceCheckUtils]: 44: Hoare triple {7750#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:32,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {7750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:32,709 INFO L273 TraceCheckUtils]: 46: Hoare triple {7751#(<= main_~i~0 10)} assume true; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:32,710 INFO L273 TraceCheckUtils]: 47: Hoare triple {7751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:32,710 INFO L273 TraceCheckUtils]: 48: Hoare triple {7751#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:32,711 INFO L273 TraceCheckUtils]: 49: Hoare triple {7751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:32,711 INFO L273 TraceCheckUtils]: 50: Hoare triple {7752#(<= main_~i~0 11)} assume true; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:32,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {7752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:32,711 INFO L273 TraceCheckUtils]: 52: Hoare triple {7752#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:32,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {7752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:32,712 INFO L273 TraceCheckUtils]: 54: Hoare triple {7753#(<= main_~i~0 12)} assume true; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:32,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {7753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:32,713 INFO L273 TraceCheckUtils]: 56: Hoare triple {7753#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:32,714 INFO L273 TraceCheckUtils]: 57: Hoare triple {7753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:32,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {7754#(<= main_~i~0 13)} assume true; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:32,715 INFO L273 TraceCheckUtils]: 59: Hoare triple {7754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:32,715 INFO L273 TraceCheckUtils]: 60: Hoare triple {7754#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:32,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {7754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:32,716 INFO L273 TraceCheckUtils]: 62: Hoare triple {7755#(<= main_~i~0 14)} assume true; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:32,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {7755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:32,717 INFO L273 TraceCheckUtils]: 64: Hoare triple {7755#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:32,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {7755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:32,718 INFO L273 TraceCheckUtils]: 66: Hoare triple {7756#(<= main_~i~0 15)} assume true; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:32,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {7756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:32,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {7756#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:32,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {7756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:32,721 INFO L273 TraceCheckUtils]: 70: Hoare triple {7757#(<= main_~i~0 16)} assume true; {7757#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:32,721 INFO L273 TraceCheckUtils]: 71: Hoare triple {7757#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7740#false} is VALID [2018-11-18 22:51:32,722 INFO L273 TraceCheckUtils]: 72: Hoare triple {7740#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {7740#false} is VALID [2018-11-18 22:51:32,722 INFO L273 TraceCheckUtils]: 73: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:32,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:32,722 INFO L256 TraceCheckUtils]: 75: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7739#true} is VALID [2018-11-18 22:51:32,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {7739#true} ~cond := #in~cond; {7739#true} is VALID [2018-11-18 22:51:32,723 INFO L273 TraceCheckUtils]: 77: Hoare triple {7739#true} assume !(0 == ~cond); {7739#true} is VALID [2018-11-18 22:51:32,723 INFO L273 TraceCheckUtils]: 78: Hoare triple {7739#true} assume true; {7739#true} is VALID [2018-11-18 22:51:32,723 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {7739#true} {7740#false} #66#return; {7740#false} is VALID [2018-11-18 22:51:32,723 INFO L273 TraceCheckUtils]: 80: Hoare triple {7740#false} havoc #t~mem4;havoc #t~mem3; {7740#false} is VALID [2018-11-18 22:51:32,723 INFO L273 TraceCheckUtils]: 81: Hoare triple {7740#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7740#false} is VALID [2018-11-18 22:51:32,723 INFO L273 TraceCheckUtils]: 82: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:32,724 INFO L273 TraceCheckUtils]: 83: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:32,724 INFO L256 TraceCheckUtils]: 84: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7739#true} is VALID [2018-11-18 22:51:32,724 INFO L273 TraceCheckUtils]: 85: Hoare triple {7739#true} ~cond := #in~cond; {7739#true} is VALID [2018-11-18 22:51:32,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {7739#true} assume !(0 == ~cond); {7739#true} is VALID [2018-11-18 22:51:32,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {7739#true} assume true; {7739#true} is VALID [2018-11-18 22:51:32,724 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7739#true} {7740#false} #66#return; {7740#false} is VALID [2018-11-18 22:51:32,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {7740#false} havoc #t~mem4;havoc #t~mem3; {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 90: Hoare triple {7740#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 91: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 92: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L256 TraceCheckUtils]: 93: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 94: Hoare triple {7740#false} ~cond := #in~cond; {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 95: Hoare triple {7740#false} assume 0 == ~cond; {7740#false} is VALID [2018-11-18 22:51:32,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {7740#false} assume !false; {7740#false} is VALID [2018-11-18 22:51:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 4 proven. 512 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:32,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:32,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:32,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:51:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:32,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:33,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {7739#true} call ULTIMATE.init(); {7739#true} is VALID [2018-11-18 22:51:33,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {7739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7739#true} is VALID [2018-11-18 22:51:33,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {7739#true} assume true; {7739#true} is VALID [2018-11-18 22:51:33,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7739#true} {7739#true} #62#return; {7739#true} is VALID [2018-11-18 22:51:33,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {7739#true} call #t~ret5 := main(); {7739#true} is VALID [2018-11-18 22:51:33,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {7739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {7776#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:33,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {7776#(<= main_~i~0 0)} assume true; {7776#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:33,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {7776#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7776#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:33,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {7776#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7776#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:33,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {7776#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:33,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {7742#(<= main_~i~0 1)} assume true; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:33,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {7742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:33,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {7742#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7742#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:33,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {7742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:33,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {7743#(<= main_~i~0 2)} assume true; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:33,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {7743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:33,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {7743#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7743#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:33,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {7743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:33,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {7744#(<= main_~i~0 3)} assume true; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:33,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {7744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:33,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {7744#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7744#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:33,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {7744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:33,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {7745#(<= main_~i~0 4)} assume true; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:33,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {7745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:33,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {7745#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7745#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:33,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {7745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:33,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {7746#(<= main_~i~0 5)} assume true; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:33,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {7746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:33,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {7746#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7746#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:33,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {7746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:33,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {7747#(<= main_~i~0 6)} assume true; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:33,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {7747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:33,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {7747#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7747#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:33,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {7747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:33,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {7748#(<= main_~i~0 7)} assume true; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:33,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {7748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:33,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {7748#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7748#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:33,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {7748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:33,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {7749#(<= main_~i~0 8)} assume true; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:33,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {7749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:33,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {7749#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7749#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:33,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {7749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:33,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {7750#(<= main_~i~0 9)} assume true; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:33,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {7750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:33,270 INFO L273 TraceCheckUtils]: 44: Hoare triple {7750#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7750#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:33,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {7750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:33,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {7751#(<= main_~i~0 10)} assume true; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:33,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {7751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:33,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {7751#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7751#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:33,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {7751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:33,274 INFO L273 TraceCheckUtils]: 50: Hoare triple {7752#(<= main_~i~0 11)} assume true; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:33,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {7752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:33,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {7752#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7752#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:33,275 INFO L273 TraceCheckUtils]: 53: Hoare triple {7752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:33,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {7753#(<= main_~i~0 12)} assume true; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:33,277 INFO L273 TraceCheckUtils]: 55: Hoare triple {7753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:33,277 INFO L273 TraceCheckUtils]: 56: Hoare triple {7753#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7753#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:33,278 INFO L273 TraceCheckUtils]: 57: Hoare triple {7753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:33,278 INFO L273 TraceCheckUtils]: 58: Hoare triple {7754#(<= main_~i~0 13)} assume true; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:33,279 INFO L273 TraceCheckUtils]: 59: Hoare triple {7754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:33,279 INFO L273 TraceCheckUtils]: 60: Hoare triple {7754#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7754#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:33,280 INFO L273 TraceCheckUtils]: 61: Hoare triple {7754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:33,281 INFO L273 TraceCheckUtils]: 62: Hoare triple {7755#(<= main_~i~0 14)} assume true; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:33,281 INFO L273 TraceCheckUtils]: 63: Hoare triple {7755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:33,282 INFO L273 TraceCheckUtils]: 64: Hoare triple {7755#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7755#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:33,282 INFO L273 TraceCheckUtils]: 65: Hoare triple {7755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:33,283 INFO L273 TraceCheckUtils]: 66: Hoare triple {7756#(<= main_~i~0 15)} assume true; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:33,283 INFO L273 TraceCheckUtils]: 67: Hoare triple {7756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:33,284 INFO L273 TraceCheckUtils]: 68: Hoare triple {7756#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {7756#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:33,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {7756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7757#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:33,285 INFO L273 TraceCheckUtils]: 70: Hoare triple {7757#(<= main_~i~0 16)} assume true; {7757#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:33,286 INFO L273 TraceCheckUtils]: 71: Hoare triple {7757#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7740#false} is VALID [2018-11-18 22:51:33,286 INFO L273 TraceCheckUtils]: 72: Hoare triple {7740#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {7740#false} is VALID [2018-11-18 22:51:33,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:33,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:33,287 INFO L256 TraceCheckUtils]: 75: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7740#false} is VALID [2018-11-18 22:51:33,287 INFO L273 TraceCheckUtils]: 76: Hoare triple {7740#false} ~cond := #in~cond; {7740#false} is VALID [2018-11-18 22:51:33,287 INFO L273 TraceCheckUtils]: 77: Hoare triple {7740#false} assume !(0 == ~cond); {7740#false} is VALID [2018-11-18 22:51:33,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:33,287 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {7740#false} {7740#false} #66#return; {7740#false} is VALID [2018-11-18 22:51:33,288 INFO L273 TraceCheckUtils]: 80: Hoare triple {7740#false} havoc #t~mem4;havoc #t~mem3; {7740#false} is VALID [2018-11-18 22:51:33,288 INFO L273 TraceCheckUtils]: 81: Hoare triple {7740#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7740#false} is VALID [2018-11-18 22:51:33,288 INFO L273 TraceCheckUtils]: 82: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:33,288 INFO L273 TraceCheckUtils]: 83: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:33,288 INFO L256 TraceCheckUtils]: 84: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7740#false} is VALID [2018-11-18 22:51:33,289 INFO L273 TraceCheckUtils]: 85: Hoare triple {7740#false} ~cond := #in~cond; {7740#false} is VALID [2018-11-18 22:51:33,289 INFO L273 TraceCheckUtils]: 86: Hoare triple {7740#false} assume !(0 == ~cond); {7740#false} is VALID [2018-11-18 22:51:33,289 INFO L273 TraceCheckUtils]: 87: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:33,289 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7740#false} {7740#false} #66#return; {7740#false} is VALID [2018-11-18 22:51:33,289 INFO L273 TraceCheckUtils]: 89: Hoare triple {7740#false} havoc #t~mem4;havoc #t~mem3; {7740#false} is VALID [2018-11-18 22:51:33,290 INFO L273 TraceCheckUtils]: 90: Hoare triple {7740#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {7740#false} is VALID [2018-11-18 22:51:33,290 INFO L273 TraceCheckUtils]: 91: Hoare triple {7740#false} assume true; {7740#false} is VALID [2018-11-18 22:51:33,290 INFO L273 TraceCheckUtils]: 92: Hoare triple {7740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7740#false} is VALID [2018-11-18 22:51:33,290 INFO L256 TraceCheckUtils]: 93: Hoare triple {7740#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7740#false} is VALID [2018-11-18 22:51:33,290 INFO L273 TraceCheckUtils]: 94: Hoare triple {7740#false} ~cond := #in~cond; {7740#false} is VALID [2018-11-18 22:51:33,291 INFO L273 TraceCheckUtils]: 95: Hoare triple {7740#false} assume 0 == ~cond; {7740#false} is VALID [2018-11-18 22:51:33,291 INFO L273 TraceCheckUtils]: 96: Hoare triple {7740#false} assume !false; {7740#false} is VALID [2018-11-18 22:51:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:51:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:51:33,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-18 22:51:33,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:33,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:51:33,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:33,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:51:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:51:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:51:33,427 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 20 states. [2018-11-18 22:51:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:33,846 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-11-18 22:51:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:51:33,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-18 22:51:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:51:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2018-11-18 22:51:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:51:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2018-11-18 22:51:33,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2018-11-18 22:51:33,948 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-18 22:51:33,951 INFO L225 Difference]: With dead ends: 134 [2018-11-18 22:51:33,951 INFO L226 Difference]: Without dead ends: 106 [2018-11-18 22:51:33,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:51:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-18 22:51:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-18 22:51:34,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:34,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-18 22:51:34,070 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-18 22:51:34,070 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-18 22:51:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:34,073 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-11-18 22:51:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-11-18 22:51:34,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:34,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:34,074 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-18 22:51:34,074 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-18 22:51:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:34,076 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-11-18 22:51:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-11-18 22:51:34,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:34,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:34,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:34,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 22:51:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-18 22:51:34,078 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 97 [2018-11-18 22:51:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:34,079 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-18 22:51:34,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:51:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-18 22:51:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 22:51:34,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:34,080 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:34,080 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:34,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1333931903, now seen corresponding path program 8 times [2018-11-18 22:51:34,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:34,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:34,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:51:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:34,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {8570#true} call ULTIMATE.init(); {8570#true} is VALID [2018-11-18 22:51:34,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {8570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8570#true} is VALID [2018-11-18 22:51:34,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-18 22:51:34,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8570#true} {8570#true} #62#return; {8570#true} is VALID [2018-11-18 22:51:34,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {8570#true} call #t~ret5 := main(); {8570#true} is VALID [2018-11-18 22:51:34,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {8570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {8572#(= main_~i~0 0)} is VALID [2018-11-18 22:51:34,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {8572#(= main_~i~0 0)} assume true; {8572#(= main_~i~0 0)} is VALID [2018-11-18 22:51:34,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {8572#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8572#(= main_~i~0 0)} is VALID [2018-11-18 22:51:34,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {8572#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8572#(= main_~i~0 0)} is VALID [2018-11-18 22:51:34,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {8572#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {8573#(<= main_~i~0 1)} assume true; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {8573#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {8573#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {8573#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {8574#(<= main_~i~0 2)} assume true; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {8574#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {8574#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {8574#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {8575#(<= main_~i~0 3)} assume true; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {8575#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {8575#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {8575#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {8576#(<= main_~i~0 4)} assume true; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {8576#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {8576#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {8576#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {8577#(<= main_~i~0 5)} assume true; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {8577#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {8577#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {8577#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {8578#(<= main_~i~0 6)} assume true; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {8578#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {8578#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {8578#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {8579#(<= main_~i~0 7)} assume true; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {8579#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {8579#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {8579#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {8580#(<= main_~i~0 8)} assume true; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {8580#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {8580#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {8580#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {8581#(<= main_~i~0 9)} assume true; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {8581#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {8581#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {8581#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,621 INFO L273 TraceCheckUtils]: 46: Hoare triple {8582#(<= main_~i~0 10)} assume true; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {8582#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {8582#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {8582#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {8583#(<= main_~i~0 11)} assume true; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {8583#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {8583#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {8583#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {8584#(<= main_~i~0 12)} assume true; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {8584#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {8584#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {8584#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,628 INFO L273 TraceCheckUtils]: 58: Hoare triple {8585#(<= main_~i~0 13)} assume true; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {8585#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {8585#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {8585#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {8586#(<= main_~i~0 14)} assume true; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {8586#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {8586#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,632 INFO L273 TraceCheckUtils]: 65: Hoare triple {8586#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {8587#(<= main_~i~0 15)} assume true; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {8587#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {8587#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {8587#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {8588#(<= main_~i~0 16)} assume true; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {8588#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,636 INFO L273 TraceCheckUtils]: 72: Hoare triple {8588#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {8588#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8589#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:34,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {8589#(<= main_~i~0 17)} assume true; {8589#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:34,638 INFO L273 TraceCheckUtils]: 75: Hoare triple {8589#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8571#false} is VALID [2018-11-18 22:51:34,638 INFO L273 TraceCheckUtils]: 76: Hoare triple {8571#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {8571#false} is VALID [2018-11-18 22:51:34,639 INFO L273 TraceCheckUtils]: 77: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,639 INFO L256 TraceCheckUtils]: 79: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8570#true} is VALID [2018-11-18 22:51:34,639 INFO L273 TraceCheckUtils]: 80: Hoare triple {8570#true} ~cond := #in~cond; {8570#true} is VALID [2018-11-18 22:51:34,639 INFO L273 TraceCheckUtils]: 81: Hoare triple {8570#true} assume !(0 == ~cond); {8570#true} is VALID [2018-11-18 22:51:34,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-18 22:51:34,640 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {8570#true} {8571#false} #66#return; {8571#false} is VALID [2018-11-18 22:51:34,640 INFO L273 TraceCheckUtils]: 84: Hoare triple {8571#false} havoc #t~mem4;havoc #t~mem3; {8571#false} is VALID [2018-11-18 22:51:34,640 INFO L273 TraceCheckUtils]: 85: Hoare triple {8571#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {8571#false} is VALID [2018-11-18 22:51:34,640 INFO L273 TraceCheckUtils]: 86: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 87: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,641 INFO L256 TraceCheckUtils]: 88: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8570#true} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 89: Hoare triple {8570#true} ~cond := #in~cond; {8570#true} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 90: Hoare triple {8570#true} assume !(0 == ~cond); {8570#true} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 91: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-18 22:51:34,641 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {8570#true} {8571#false} #66#return; {8571#false} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 93: Hoare triple {8571#false} havoc #t~mem4;havoc #t~mem3; {8571#false} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 94: Hoare triple {8571#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {8571#false} is VALID [2018-11-18 22:51:34,641 INFO L273 TraceCheckUtils]: 95: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,642 INFO L273 TraceCheckUtils]: 96: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,642 INFO L256 TraceCheckUtils]: 97: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-18 22:51:34,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-18 22:51:34,642 INFO L273 TraceCheckUtils]: 99: Hoare triple {8571#false} assume 0 == ~cond; {8571#false} is VALID [2018-11-18 22:51:34,642 INFO L273 TraceCheckUtils]: 100: Hoare triple {8571#false} assume !false; {8571#false} is VALID [2018-11-18 22:51:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 4 proven. 578 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:34,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:34,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:34,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:51:34,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:51:34,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:34,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:34,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {8570#true} call ULTIMATE.init(); {8570#true} is VALID [2018-11-18 22:51:34,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {8570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8570#true} is VALID [2018-11-18 22:51:34,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {8570#true} assume true; {8570#true} is VALID [2018-11-18 22:51:34,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8570#true} {8570#true} #62#return; {8570#true} is VALID [2018-11-18 22:51:34,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {8570#true} call #t~ret5 := main(); {8570#true} is VALID [2018-11-18 22:51:34,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {8570#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {8608#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:34,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {8608#(<= main_~i~0 0)} assume true; {8608#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:34,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {8608#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:34,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {8608#(<= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8608#(<= main_~i~0 0)} is VALID [2018-11-18 22:51:34,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {8608#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {8573#(<= main_~i~0 1)} assume true; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {8573#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {8573#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8573#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:34,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {8573#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {8574#(<= main_~i~0 2)} assume true; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {8574#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {8574#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8574#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:34,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {8574#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {8575#(<= main_~i~0 3)} assume true; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {8575#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {8575#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8575#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:34,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {8575#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {8576#(<= main_~i~0 4)} assume true; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {8576#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {8576#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8576#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:34,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {8576#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {8577#(<= main_~i~0 5)} assume true; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {8577#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {8577#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8577#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:34,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {8577#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {8578#(<= main_~i~0 6)} assume true; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {8578#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {8578#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8578#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:34,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {8578#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {8579#(<= main_~i~0 7)} assume true; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {8579#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {8579#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8579#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:34,956 INFO L273 TraceCheckUtils]: 37: Hoare triple {8579#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {8580#(<= main_~i~0 8)} assume true; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {8580#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {8580#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8580#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:34,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {8580#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {8581#(<= main_~i~0 9)} assume true; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,960 INFO L273 TraceCheckUtils]: 43: Hoare triple {8581#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,960 INFO L273 TraceCheckUtils]: 44: Hoare triple {8581#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8581#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:34,961 INFO L273 TraceCheckUtils]: 45: Hoare triple {8581#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,961 INFO L273 TraceCheckUtils]: 46: Hoare triple {8582#(<= main_~i~0 10)} assume true; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,962 INFO L273 TraceCheckUtils]: 47: Hoare triple {8582#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,962 INFO L273 TraceCheckUtils]: 48: Hoare triple {8582#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8582#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:34,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {8582#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,964 INFO L273 TraceCheckUtils]: 50: Hoare triple {8583#(<= main_~i~0 11)} assume true; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,964 INFO L273 TraceCheckUtils]: 51: Hoare triple {8583#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,965 INFO L273 TraceCheckUtils]: 52: Hoare triple {8583#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8583#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:34,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {8583#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {8584#(<= main_~i~0 12)} assume true; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {8584#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {8584#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8584#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:34,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {8584#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {8585#(<= main_~i~0 13)} assume true; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,969 INFO L273 TraceCheckUtils]: 59: Hoare triple {8585#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {8585#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8585#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:34,970 INFO L273 TraceCheckUtils]: 61: Hoare triple {8585#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,970 INFO L273 TraceCheckUtils]: 62: Hoare triple {8586#(<= main_~i~0 14)} assume true; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,971 INFO L273 TraceCheckUtils]: 63: Hoare triple {8586#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,972 INFO L273 TraceCheckUtils]: 64: Hoare triple {8586#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8586#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:34,972 INFO L273 TraceCheckUtils]: 65: Hoare triple {8586#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,973 INFO L273 TraceCheckUtils]: 66: Hoare triple {8587#(<= main_~i~0 15)} assume true; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,973 INFO L273 TraceCheckUtils]: 67: Hoare triple {8587#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {8587#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8587#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:34,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {8587#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {8588#(<= main_~i~0 16)} assume true; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {8588#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {8588#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {8588#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:34,977 INFO L273 TraceCheckUtils]: 73: Hoare triple {8588#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8589#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:34,977 INFO L273 TraceCheckUtils]: 74: Hoare triple {8589#(<= main_~i~0 17)} assume true; {8589#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:34,978 INFO L273 TraceCheckUtils]: 75: Hoare triple {8589#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8571#false} is VALID [2018-11-18 22:51:34,978 INFO L273 TraceCheckUtils]: 76: Hoare triple {8571#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {8571#false} is VALID [2018-11-18 22:51:34,978 INFO L273 TraceCheckUtils]: 77: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,979 INFO L256 TraceCheckUtils]: 79: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-18 22:51:34,979 INFO L273 TraceCheckUtils]: 80: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-18 22:51:34,979 INFO L273 TraceCheckUtils]: 81: Hoare triple {8571#false} assume !(0 == ~cond); {8571#false} is VALID [2018-11-18 22:51:34,979 INFO L273 TraceCheckUtils]: 82: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {8571#false} {8571#false} #66#return; {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {8571#false} havoc #t~mem4;havoc #t~mem3; {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L273 TraceCheckUtils]: 85: Hoare triple {8571#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L273 TraceCheckUtils]: 87: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,980 INFO L256 TraceCheckUtils]: 88: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 90: Hoare triple {8571#false} assume !(0 == ~cond); {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {8571#false} {8571#false} #66#return; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 93: Hoare triple {8571#false} havoc #t~mem4;havoc #t~mem3; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 94: Hoare triple {8571#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 95: Hoare triple {8571#false} assume true; {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L273 TraceCheckUtils]: 96: Hoare triple {8571#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8571#false} is VALID [2018-11-18 22:51:34,981 INFO L256 TraceCheckUtils]: 97: Hoare triple {8571#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8571#false} is VALID [2018-11-18 22:51:34,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {8571#false} ~cond := #in~cond; {8571#false} is VALID [2018-11-18 22:51:34,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {8571#false} assume 0 == ~cond; {8571#false} is VALID [2018-11-18 22:51:34,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {8571#false} assume !false; {8571#false} is VALID [2018-11-18 22:51:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:51:35,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:35,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:51:35,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-11-18 22:51:35,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:35,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:51:35,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:35,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:51:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:51:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:51:35,097 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2018-11-18 22:51:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:36,075 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-11-18 22:51:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:51:36,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-11-18 22:51:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:51:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:51:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 108 transitions. [2018-11-18 22:51:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:51:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 108 transitions. [2018-11-18 22:51:36,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 108 transitions. [2018-11-18 22:51:36,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:36,279 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:51:36,279 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 22:51:36,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:51:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 22:51:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-18 22:51:36,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:51:36,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-18 22:51:36,416 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-18 22:51:36,417 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-18 22:51:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:36,419 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-11-18 22:51:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-18 22:51:36,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:36,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:36,420 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-18 22:51:36,420 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-18 22:51:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:51:36,422 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-11-18 22:51:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-18 22:51:36,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:51:36,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:51:36,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:51:36,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:51:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 22:51:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-18 22:51:36,425 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 101 [2018-11-18 22:51:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:51:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-18 22:51:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:51:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-18 22:51:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 22:51:36,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:51:36,427 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:51:36,427 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:51:36,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:51:36,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1931266855, now seen corresponding path program 9 times [2018-11-18 22:51:36,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:51:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:51:36,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:36,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:51:36,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:51:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:36,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {9432#true} call ULTIMATE.init(); {9432#true} is VALID [2018-11-18 22:51:36,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {9432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9432#true} is VALID [2018-11-18 22:51:36,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {9432#true} assume true; {9432#true} is VALID [2018-11-18 22:51:36,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9432#true} {9432#true} #62#return; {9432#true} is VALID [2018-11-18 22:51:36,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {9432#true} call #t~ret5 := main(); {9432#true} is VALID [2018-11-18 22:51:36,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {9432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {9434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:36,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {9434#(= main_~i~0 0)} assume true; {9434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:36,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {9434#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:36,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {9434#(= main_~i~0 0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9434#(= main_~i~0 0)} is VALID [2018-11-18 22:51:36,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {9434#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:36,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {9435#(<= main_~i~0 1)} assume true; {9435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:36,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {9435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:36,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {9435#(<= main_~i~0 1)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9435#(<= main_~i~0 1)} is VALID [2018-11-18 22:51:36,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {9435#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:36,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {9436#(<= main_~i~0 2)} assume true; {9436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:36,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {9436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:36,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {9436#(<= main_~i~0 2)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9436#(<= main_~i~0 2)} is VALID [2018-11-18 22:51:36,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {9436#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:36,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {9437#(<= main_~i~0 3)} assume true; {9437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:36,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {9437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:36,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {9437#(<= main_~i~0 3)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9437#(<= main_~i~0 3)} is VALID [2018-11-18 22:51:36,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {9437#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:36,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {9438#(<= main_~i~0 4)} assume true; {9438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:36,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {9438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:36,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {9438#(<= main_~i~0 4)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9438#(<= main_~i~0 4)} is VALID [2018-11-18 22:51:36,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {9438#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:36,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {9439#(<= main_~i~0 5)} assume true; {9439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:36,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {9439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:36,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {9439#(<= main_~i~0 5)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9439#(<= main_~i~0 5)} is VALID [2018-11-18 22:51:36,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {9439#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:36,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {9440#(<= main_~i~0 6)} assume true; {9440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:36,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {9440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:36,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {9440#(<= main_~i~0 6)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9440#(<= main_~i~0 6)} is VALID [2018-11-18 22:51:36,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {9440#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:36,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {9441#(<= main_~i~0 7)} assume true; {9441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:36,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {9441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:36,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {9441#(<= main_~i~0 7)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9441#(<= main_~i~0 7)} is VALID [2018-11-18 22:51:36,956 INFO L273 TraceCheckUtils]: 37: Hoare triple {9441#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:36,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {9442#(<= main_~i~0 8)} assume true; {9442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:36,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {9442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:36,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {9442#(<= main_~i~0 8)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9442#(<= main_~i~0 8)} is VALID [2018-11-18 22:51:36,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {9442#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:36,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {9443#(<= main_~i~0 9)} assume true; {9443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:36,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {9443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:36,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {9443#(<= main_~i~0 9)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9443#(<= main_~i~0 9)} is VALID [2018-11-18 22:51:36,960 INFO L273 TraceCheckUtils]: 45: Hoare triple {9443#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:36,961 INFO L273 TraceCheckUtils]: 46: Hoare triple {9444#(<= main_~i~0 10)} assume true; {9444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:36,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {9444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:36,962 INFO L273 TraceCheckUtils]: 48: Hoare triple {9444#(<= main_~i~0 10)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9444#(<= main_~i~0 10)} is VALID [2018-11-18 22:51:36,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {9444#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:36,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {9445#(<= main_~i~0 11)} assume true; {9445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:36,964 INFO L273 TraceCheckUtils]: 51: Hoare triple {9445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:36,964 INFO L273 TraceCheckUtils]: 52: Hoare triple {9445#(<= main_~i~0 11)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9445#(<= main_~i~0 11)} is VALID [2018-11-18 22:51:36,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {9445#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:36,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {9446#(<= main_~i~0 12)} assume true; {9446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:36,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {9446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:36,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {9446#(<= main_~i~0 12)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9446#(<= main_~i~0 12)} is VALID [2018-11-18 22:51:36,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {9446#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:36,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {9447#(<= main_~i~0 13)} assume true; {9447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:36,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {9447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:36,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {9447#(<= main_~i~0 13)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9447#(<= main_~i~0 13)} is VALID [2018-11-18 22:51:36,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {9447#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9448#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:36,970 INFO L273 TraceCheckUtils]: 62: Hoare triple {9448#(<= main_~i~0 14)} assume true; {9448#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:36,970 INFO L273 TraceCheckUtils]: 63: Hoare triple {9448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9448#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:36,971 INFO L273 TraceCheckUtils]: 64: Hoare triple {9448#(<= main_~i~0 14)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9448#(<= main_~i~0 14)} is VALID [2018-11-18 22:51:36,972 INFO L273 TraceCheckUtils]: 65: Hoare triple {9448#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9449#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:36,972 INFO L273 TraceCheckUtils]: 66: Hoare triple {9449#(<= main_~i~0 15)} assume true; {9449#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:36,973 INFO L273 TraceCheckUtils]: 67: Hoare triple {9449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9449#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:36,973 INFO L273 TraceCheckUtils]: 68: Hoare triple {9449#(<= main_~i~0 15)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9449#(<= main_~i~0 15)} is VALID [2018-11-18 22:51:36,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {9449#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9450#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:36,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {9450#(<= main_~i~0 16)} assume true; {9450#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:36,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {9450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9450#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:36,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {9450#(<= main_~i~0 16)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9450#(<= main_~i~0 16)} is VALID [2018-11-18 22:51:36,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {9450#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9451#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:36,977 INFO L273 TraceCheckUtils]: 74: Hoare triple {9451#(<= main_~i~0 17)} assume true; {9451#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:36,977 INFO L273 TraceCheckUtils]: 75: Hoare triple {9451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9451#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:36,978 INFO L273 TraceCheckUtils]: 76: Hoare triple {9451#(<= main_~i~0 17)} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9451#(<= main_~i~0 17)} is VALID [2018-11-18 22:51:36,979 INFO L273 TraceCheckUtils]: 77: Hoare triple {9451#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9452#(<= main_~i~0 18)} is VALID [2018-11-18 22:51:36,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {9452#(<= main_~i~0 18)} assume true; {9452#(<= main_~i~0 18)} is VALID [2018-11-18 22:51:36,980 INFO L273 TraceCheckUtils]: 79: Hoare triple {9452#(<= main_~i~0 18)} assume !(~i~0 < 100000); {9433#false} is VALID [2018-11-18 22:51:36,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {9433#false} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {9433#false} is VALID [2018-11-18 22:51:36,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {9433#false} assume true; {9433#false} is VALID [2018-11-18 22:51:36,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {9433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9433#false} is VALID [2018-11-18 22:51:36,981 INFO L256 TraceCheckUtils]: 83: Hoare triple {9433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9432#true} is VALID [2018-11-18 22:51:36,981 INFO L273 TraceCheckUtils]: 84: Hoare triple {9432#true} ~cond := #in~cond; {9432#true} is VALID [2018-11-18 22:51:36,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {9432#true} assume !(0 == ~cond); {9432#true} is VALID [2018-11-18 22:51:36,981 INFO L273 TraceCheckUtils]: 86: Hoare triple {9432#true} assume true; {9432#true} is VALID [2018-11-18 22:51:36,981 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {9432#true} {9433#false} #66#return; {9433#false} is VALID [2018-11-18 22:51:36,982 INFO L273 TraceCheckUtils]: 88: Hoare triple {9433#false} havoc #t~mem4;havoc #t~mem3; {9433#false} is VALID [2018-11-18 22:51:36,982 INFO L273 TraceCheckUtils]: 89: Hoare triple {9433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9433#false} is VALID [2018-11-18 22:51:36,982 INFO L273 TraceCheckUtils]: 90: Hoare triple {9433#false} assume true; {9433#false} is VALID [2018-11-18 22:51:36,982 INFO L273 TraceCheckUtils]: 91: Hoare triple {9433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9433#false} is VALID [2018-11-18 22:51:36,982 INFO L256 TraceCheckUtils]: 92: Hoare triple {9433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9432#true} is VALID [2018-11-18 22:51:36,983 INFO L273 TraceCheckUtils]: 93: Hoare triple {9432#true} ~cond := #in~cond; {9432#true} is VALID [2018-11-18 22:51:36,983 INFO L273 TraceCheckUtils]: 94: Hoare triple {9432#true} assume !(0 == ~cond); {9432#true} is VALID [2018-11-18 22:51:36,983 INFO L273 TraceCheckUtils]: 95: Hoare triple {9432#true} assume true; {9432#true} is VALID [2018-11-18 22:51:36,983 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {9432#true} {9433#false} #66#return; {9433#false} is VALID [2018-11-18 22:51:36,983 INFO L273 TraceCheckUtils]: 97: Hoare triple {9433#false} havoc #t~mem4;havoc #t~mem3; {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 98: Hoare triple {9433#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 99: Hoare triple {9433#false} assume true; {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 100: Hoare triple {9433#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L256 TraceCheckUtils]: 101: Hoare triple {9433#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 102: Hoare triple {9433#false} ~cond := #in~cond; {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 103: Hoare triple {9433#false} assume 0 == ~cond; {9433#false} is VALID [2018-11-18 22:51:36,984 INFO L273 TraceCheckUtils]: 104: Hoare triple {9433#false} assume !false; {9433#false} is VALID [2018-11-18 22:51:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 4 proven. 648 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:51:36,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:51:36,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:51:37,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:51:37,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-18 22:51:37,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:51:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:51:37,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:51:37,157 INFO L477 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-18 22:51:37,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:51:37,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:51:37,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-18 22:51:39,696 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8)))) is different from true [2018-11-18 22:51:41,847 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)))) is different from true [2018-11-18 22:51:42,001 INFO L477 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 26 treesize of output 22 [2018-11-18 22:51:42,007 INFO L477 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 13 treesize of output 5 [2018-11-18 22:51:42,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:51:42,024 INFO L477 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 11 treesize of output 3 [2018-11-18 22:51:42,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:51:42,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:51:42,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:51:42,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-18 22:51:42,035 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:51:42,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {9432#true} call ULTIMATE.init(); {9432#true} is VALID [2018-11-18 22:51:42,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {9432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9432#true} is VALID [2018-11-18 22:51:42,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {9432#true} assume true; {9432#true} is VALID [2018-11-18 22:51:42,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9432#true} {9432#true} #62#return; {9432#true} is VALID [2018-11-18 22:51:42,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {9432#true} call #t~ret5 := main(); {9432#true} is VALID [2018-11-18 22:51:42,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {9432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~rv~0 := 1; {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {9471#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {9484#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (= main_~i~0 1) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9497#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {9497#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume true; {9497#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {9497#(and (= 1 main_~rv~0) (= main_~i~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9504#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {9504#(and (= 1 main_~rv~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) |main_#t~mem1|) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,175 INFO L273 TraceCheckUtils]: 41: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,177 INFO L273 TraceCheckUtils]: 43: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,188 INFO L273 TraceCheckUtils]: 56: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,189 INFO L273 TraceCheckUtils]: 57: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,194 INFO L273 TraceCheckUtils]: 63: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,195 INFO L273 TraceCheckUtils]: 64: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,197 INFO L273 TraceCheckUtils]: 66: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,198 INFO L273 TraceCheckUtils]: 67: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,199 INFO L273 TraceCheckUtils]: 68: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,200 INFO L273 TraceCheckUtils]: 70: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,203 INFO L273 TraceCheckUtils]: 73: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,204 INFO L273 TraceCheckUtils]: 74: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,205 INFO L273 TraceCheckUtils]: 75: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,206 INFO L273 TraceCheckUtils]: 76: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 != #t~mem1);havoc #t~mem1;havoc #t~mem0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,207 INFO L273 TraceCheckUtils]: 77: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 1 + ~i~0; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,207 INFO L273 TraceCheckUtils]: 78: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,208 INFO L273 TraceCheckUtils]: 79: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,209 INFO L273 TraceCheckUtils]: 80: Hoare triple {9508#(and (= 1 main_~rv~0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume 0 != ~rv~0;havoc ~x~0;~x~0 := 0; {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,210 INFO L273 TraceCheckUtils]: 81: Hoare triple {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,211 INFO L273 TraceCheckUtils]: 82: Hoare triple {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,213 INFO L256 TraceCheckUtils]: 83: Hoare triple {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-18 22:51:42,214 INFO L273 TraceCheckUtils]: 84: Hoare triple {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} ~cond := #in~cond; {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-18 22:51:42,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} assume !(0 == ~cond); {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-18 22:51:42,215 INFO L273 TraceCheckUtils]: 86: Hoare triple {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} assume true; {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-18 22:51:42,216 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {9711#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8))))} {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #66#return; {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {9701#(and (= main_~x~0 0) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,219 INFO L273 TraceCheckUtils]: 91: Hoare triple {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,221 INFO L256 TraceCheckUtils]: 92: Hoare triple {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-18 22:51:42,222 INFO L273 TraceCheckUtils]: 93: Hoare triple {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} ~cond := #in~cond; {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-18 22:51:42,222 INFO L273 TraceCheckUtils]: 94: Hoare triple {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} assume !(0 == ~cond); {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-18 22:51:42,223 INFO L273 TraceCheckUtils]: 95: Hoare triple {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} assume true; {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-18 22:51:42,224 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {9740#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|))))} {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #66#return; {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,224 INFO L273 TraceCheckUtils]: 97: Hoare triple {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem4;havoc #t~mem3; {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,225 INFO L273 TraceCheckUtils]: 98: Hoare triple {9730#(and (= main_~x~0 1) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {9759#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,225 INFO L273 TraceCheckUtils]: 99: Hoare triple {9759#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {9759#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:51:42,226 INFO L273 TraceCheckUtils]: 100: Hoare triple {9759#(and (= main_~x~0 2) (= |main_~#b~0.offset| 0) (not (= |main_~#b~0.base| |main_~#a~0.base|)) (= (select (select |#memory_int| |main_~#b~0.base|) (+ |main_~#b~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9766#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-18 22:51:42,227 INFO L256 TraceCheckUtils]: 101: Hoare triple {9766#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9770#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 22:51:42,228 INFO L273 TraceCheckUtils]: 102: Hoare triple {9770#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9774#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:51:42,228 INFO L273 TraceCheckUtils]: 103: Hoare triple {9774#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9433#false} is VALID [2018-11-18 22:51:42,229 INFO L273 TraceCheckUtils]: 104: Hoare triple {9433#false} assume !false; {9433#false} is VALID [2018-11-18 22:51:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 465 trivial. 8 not checked. [2018-11-18 22:51:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:51:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 34 [2018-11-18 22:51:42,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2018-11-18 22:51:42,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:51:42,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:51:42,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:51:42,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:51:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:51:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=708, Unknown=2, NotChecked=122, Total=1122 [2018-11-18 22:51:42,475 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 34 states.