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_copy5_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:43:13,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:43:13,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:43:13,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:43:13,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:43:13,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:43:13,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:43:13,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:43:13,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:43:13,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:43:13,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:43:13,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:43:13,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:43:13,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:43:13,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:43:13,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:43:13,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:43:13,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:43:13,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:43:13,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:43:13,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:43:13,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:43:13,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:43:13,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:43:13,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:43:13,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:43:13,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:43:13,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:43:13,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:43:13,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:43:13,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:43:13,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:43:13,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:43:13,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:43:13,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:43:13,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:43:13,168 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:43:13,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:43:13,184 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:43:13,185 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:43:13,186 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:43:13,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:43:13,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:43:13,187 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:43:13,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:43:13,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:43:13,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:43:13,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:43:13,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:43:13,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:43:13,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:43:13,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:43:13,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:43:13,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:43:13,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:43:13,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:43:13,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:43:13,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:43:13,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:43:13,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:43:13,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:13,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:43:13,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:43:13,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:43:13,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:43:13,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:43:13,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:43:13,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:43:13,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:43:13,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:43:13,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:43:13,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:43:13,254 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:43:13,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-18 22:43:13,319 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4177b7b2c/407fab85e9e841a89166bee451745c96/FLAGae238d619 [2018-11-18 22:43:13,778 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:43:13,779 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-18 22:43:13,786 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4177b7b2c/407fab85e9e841a89166bee451745c96/FLAGae238d619 [2018-11-18 22:43:14,145 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4177b7b2c/407fab85e9e841a89166bee451745c96 [2018-11-18 22:43:14,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:43:14,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:43:14,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:43:14,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:43:14,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621c9147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14, skipping insertion in model container [2018-11-18 22:43:14,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:43:14,208 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:43:14,438 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,443 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:43:14,480 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,506 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:43:14,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14 WrapperNode [2018-11-18 22:43:14,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:43:14,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:43:14,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:43:14,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:43:14,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:43:14,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (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:43:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:43:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:43:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:43:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:43:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:43:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:43:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:43:14,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:43:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:43:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:43:15,766 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:43:15,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15 BoogieIcfgContainer [2018-11-18 22:43:15,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:43:15,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:43:15,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:43:15,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:43:15,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:43:14" (1/3) ... [2018-11-18 22:43:15,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0967da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (2/3) ... [2018-11-18 22:43:15,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0967da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15" (3/3) ... [2018-11-18 22:43:15,774 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_false-unreach-call_ground.i [2018-11-18 22:43:15,782 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:43:15,791 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:43:15,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:43:15,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:43:15,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:43:15,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:43:15,840 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:43:15,840 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:43:15,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:43:15,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:43:15,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:43:15,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:43:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-18 22:43:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:43:15,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:15,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:15,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:15,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 663718763, now seen corresponding path program 1 times [2018-11-18 22:43:15,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:15,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:16,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-18 22:43:16,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49#true} is VALID [2018-11-18 22:43:16,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-18 22:43:16,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #126#return; {49#true} is VALID [2018-11-18 22:43:16,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret16 := main(); {49#true} is VALID [2018-11-18 22:43:16,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {49#true} is VALID [2018-11-18 22:43:16,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#true} assume !true; {50#false} is VALID [2018-11-18 22:43:16,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#false} havoc ~i~0;~i~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-18 22:43:16,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-18 22:43:16,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-18 22:43:16,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-18 22:43:16,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-18 22:43:16,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {50#false} havoc ~x~0;~x~0 := 0; {50#false} is VALID [2018-11-18 22:43:16,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-18 22:43:16,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {50#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {50#false} is VALID [2018-11-18 22:43:16,096 INFO L256 TraceCheckUtils]: 20: Hoare triple {50#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {50#false} is VALID [2018-11-18 22:43:16,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2018-11-18 22:43:16,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {50#false} assume 0 == ~cond; {50#false} is VALID [2018-11-18 22:43:16,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-18 22:43:16,102 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:43:16,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:43:16,110 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 22:43:16,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:16,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:43:16,228 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:43:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:43:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:43:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:16,239 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-18 22:43:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,436 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-18 22:43:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:43:16,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 22:43:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-18 22:43:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-18 22:43:16,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2018-11-18 22:43:17,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,263 INFO L225 Difference]: With dead ends: 83 [2018-11-18 22:43:17,264 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 22:43:17,268 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:43:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 22:43:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 22:43:17,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:17,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-18 22:43:17,328 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 22:43:17,328 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 22:43:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,334 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-18 22:43:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 22:43:17,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,335 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 22:43:17,335 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 22:43:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,341 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-18 22:43:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 22:43:17,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:17,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:43:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 22:43:17,348 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 24 [2018-11-18 22:43:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:17,349 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 22:43:17,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:43:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 22:43:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:43:17,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:17,351 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:17,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:17,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1010111724, now seen corresponding path program 1 times [2018-11-18 22:43:17,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2018-11-18 22:43:17,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {293#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {293#true} is VALID [2018-11-18 22:43:17,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2018-11-18 22:43:17,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #126#return; {293#true} is VALID [2018-11-18 22:43:17,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret16 := main(); {293#true} is VALID [2018-11-18 22:43:17,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {293#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {295#(= main_~a~0 0)} is VALID [2018-11-18 22:43:17,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {295#(= main_~a~0 0)} assume true; {295#(= main_~a~0 0)} is VALID [2018-11-18 22:43:17,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#(= main_~a~0 0)} assume !(~a~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {294#false} havoc ~i~0;~i~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-18 22:43:17,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {294#false} havoc ~x~0;~x~0 := 0; {294#false} is VALID [2018-11-18 22:43:17,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-18 22:43:17,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {294#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {294#false} is VALID [2018-11-18 22:43:17,526 INFO L256 TraceCheckUtils]: 26: Hoare triple {294#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {294#false} is VALID [2018-11-18 22:43:17,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2018-11-18 22:43:17,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {294#false} assume 0 == ~cond; {294#false} is VALID [2018-11-18 22:43:17,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {294#false} assume !false; {294#false} is VALID [2018-11-18 22:43:17,529 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:43:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:17,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 22:43:17,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:17,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:17,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:17,602 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-18 22:43:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,920 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 22:43:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:17,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 22:43:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-18 22:43:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-18 22:43:17,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-18 22:43:18,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,117 INFO L225 Difference]: With dead ends: 76 [2018-11-18 22:43:18,117 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:43:18,118 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:43:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:43:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 22:43:18,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:18,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-18 22:43:18,144 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-18 22:43:18,144 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-18 22:43:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,147 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-18 22:43:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-18 22:43:18,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,149 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-18 22:43:18,149 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-18 22:43:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,152 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-18 22:43:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-18 22:43:18,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:18,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:43:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-18 22:43:18,157 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2018-11-18 22:43:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:18,157 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-18 22:43:18,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 22:43:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:43:18,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:18,159 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:18,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:18,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash -648560439, now seen corresponding path program 1 times [2018-11-18 22:43:18,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-18 22:43:18,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-18 22:43:18,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-18 22:43:18,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #126#return; {541#true} is VALID [2018-11-18 22:43:18,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret16 := main(); {541#true} is VALID [2018-11-18 22:43:18,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {541#true} is VALID [2018-11-18 22:43:18,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-18 22:43:18,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {541#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {541#true} is VALID [2018-11-18 22:43:18,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {541#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {541#true} is VALID [2018-11-18 22:43:18,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-18 22:43:18,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#true} assume !(~a~0 < 100000); {541#true} is VALID [2018-11-18 22:43:18,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#true} havoc ~i~0;~i~0 := 0; {543#(= main_~i~0 0)} is VALID [2018-11-18 22:43:18,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(= main_~i~0 0)} assume true; {543#(= main_~i~0 0)} is VALID [2018-11-18 22:43:18,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(= main_~i~0 0)} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-18 22:43:18,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-18 22:43:18,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 22:43:18,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-18 22:43:18,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-18 22:43:18,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 22:43:18,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-18 22:43:18,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-18 22:43:18,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 22:43:18,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-18 22:43:18,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-18 22:43:18,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 22:43:18,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-18 22:43:18,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {542#false} havoc ~x~0;~x~0 := 0; {542#false} is VALID [2018-11-18 22:43:18,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 22:43:18,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {542#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {542#false} is VALID [2018-11-18 22:43:18,267 INFO L256 TraceCheckUtils]: 29: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {542#false} is VALID [2018-11-18 22:43:18,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-18 22:43:18,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2018-11-18 22:43:18,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-18 22:43:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:18,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:18,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:18,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 22:43:18,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:18,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:18,386 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:43:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:18,390 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-18 22:43:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,700 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-11-18 22:43:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 22:43:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-18 22:43:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-18 22:43:18,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-18 22:43:18,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,888 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:43:18,888 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 22:43:18,889 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:43:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 22:43:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-11-18 22:43:18,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:18,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 53 states. [2018-11-18 22:43:18,927 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 53 states. [2018-11-18 22:43:18,928 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 53 states. [2018-11-18 22:43:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,931 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-18 22:43:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-18 22:43:18,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,933 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 58 states. [2018-11-18 22:43:18,933 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 58 states. [2018-11-18 22:43:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,937 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-18 22:43:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-18 22:43:18,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:18,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:43:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-18 22:43:18,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 33 [2018-11-18 22:43:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:18,942 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-18 22:43:18,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-18 22:43:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 22:43:18,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:18,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:18,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:18,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash -940686717, now seen corresponding path program 1 times [2018-11-18 22:43:18,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2018-11-18 22:43:19,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {846#true} is VALID [2018-11-18 22:43:19,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2018-11-18 22:43:19,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #126#return; {846#true} is VALID [2018-11-18 22:43:19,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret16 := main(); {846#true} is VALID [2018-11-18 22:43:19,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {848#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {848#(= main_~a~0 0)} assume true; {848#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {848#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {849#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~a~0 1)} assume true; {849#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~a~0 1)} assume !(~a~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {847#false} havoc ~i~0;~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {847#false} is VALID [2018-11-18 22:43:19,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {847#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {847#false} is VALID [2018-11-18 22:43:19,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {847#false} is VALID [2018-11-18 22:43:19,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {847#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {847#false} is VALID [2018-11-18 22:43:19,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {847#false} is VALID [2018-11-18 22:43:19,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {847#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {847#false} is VALID [2018-11-18 22:43:19,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {847#false} is VALID [2018-11-18 22:43:19,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {847#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {847#false} is VALID [2018-11-18 22:43:19,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {847#false} is VALID [2018-11-18 22:43:19,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {847#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {847#false} is VALID [2018-11-18 22:43:19,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {847#false} havoc ~x~0;~x~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {847#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {847#false} is VALID [2018-11-18 22:43:19,091 INFO L256 TraceCheckUtils]: 44: Hoare triple {847#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {847#false} is VALID [2018-11-18 22:43:19,092 INFO L273 TraceCheckUtils]: 45: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2018-11-18 22:43:19,092 INFO L273 TraceCheckUtils]: 46: Hoare triple {847#false} assume 0 == ~cond; {847#false} is VALID [2018-11-18 22:43:19,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {847#false} assume !false; {847#false} is VALID [2018-11-18 22:43:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:43:19,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:19,097 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:43:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:19,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2018-11-18 22:43:19,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {846#true} is VALID [2018-11-18 22:43:19,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2018-11-18 22:43:19,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #126#return; {846#true} is VALID [2018-11-18 22:43:19,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret16 := main(); {846#true} is VALID [2018-11-18 22:43:19,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {846#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {868#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(<= main_~a~0 0)} assume true; {868#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {868#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {868#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {868#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {849#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~a~0 1)} assume true; {849#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~a~0 1)} assume !(~a~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {847#false} havoc ~i~0;~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {847#false} is VALID [2018-11-18 22:43:19,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {847#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {847#false} is VALID [2018-11-18 22:43:19,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {847#false} is VALID [2018-11-18 22:43:19,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {847#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {847#false} is VALID [2018-11-18 22:43:19,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {847#false} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {847#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {847#false} is VALID [2018-11-18 22:43:19,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {847#false} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {847#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {847#false} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {847#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {847#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {847#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {847#false} havoc ~x~0;~x~0 := 0; {847#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 42: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {847#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {847#false} is VALID [2018-11-18 22:43:19,831 INFO L256 TraceCheckUtils]: 44: Hoare triple {847#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {847#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 45: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {847#false} assume 0 == ~cond; {847#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {847#false} assume !false; {847#false} is VALID [2018-11-18 22:43:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:43:19,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:19,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:43:19,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 22:43:19,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:19,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:43:20,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:43:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:43:20,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:20,011 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2018-11-18 22:43:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,301 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-18 22:43:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:43:20,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 22:43:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-18 22:43:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-18 22:43:20,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2018-11-18 22:43:20,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,488 INFO L225 Difference]: With dead ends: 99 [2018-11-18 22:43:20,489 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 22:43:20,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 22:43:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-18 22:43:20,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:20,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:20,560 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:20,560 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,564 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-18 22:43:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-18 22:43:20,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,565 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-18 22:43:20,565 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-18 22:43:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,568 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-18 22:43:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-18 22:43:20,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:20,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:43:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-18 22:43:20,573 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 48 [2018-11-18 22:43:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:20,573 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-18 22:43:20,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:43:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-18 22:43:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:43:20,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:20,575 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:20,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:20,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:20,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2079494432, now seen corresponding path program 2 times [2018-11-18 22:43:20,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:20,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-18 22:43:20,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1316#true} is VALID [2018-11-18 22:43:20,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1316#true} {1316#true} #126#return; {1316#true} is VALID [2018-11-18 22:43:20,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {1316#true} call #t~ret16 := main(); {1316#true} is VALID [2018-11-18 22:43:20,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {1316#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1318#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {1318#(= main_~a~0 0)} assume true; {1318#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {1318#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1318#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {1318#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1319#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {1319#(<= main_~a~0 1)} assume true; {1319#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {1319#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1319#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {1319#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1320#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {1320#(<= main_~a~0 2)} assume true; {1320#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {1320#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {1317#false} havoc ~i~0;~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1317#false} is VALID [2018-11-18 22:43:20,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {1317#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1317#false} is VALID [2018-11-18 22:43:20,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1317#false} is VALID [2018-11-18 22:43:20,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {1317#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1317#false} is VALID [2018-11-18 22:43:20,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1317#false} is VALID [2018-11-18 22:43:20,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {1317#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1317#false} is VALID [2018-11-18 22:43:20,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1317#false} is VALID [2018-11-18 22:43:20,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {1317#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1317#false} is VALID [2018-11-18 22:43:20,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1317#false} is VALID [2018-11-18 22:43:20,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {1317#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1317#false} is VALID [2018-11-18 22:43:20,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,736 INFO L273 TraceCheckUtils]: 44: Hoare triple {1317#false} havoc ~x~0;~x~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {1317#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1317#false} is VALID [2018-11-18 22:43:20,737 INFO L256 TraceCheckUtils]: 47: Hoare triple {1317#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1317#false} is VALID [2018-11-18 22:43:20,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {1317#false} ~cond := #in~cond; {1317#false} is VALID [2018-11-18 22:43:20,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {1317#false} assume 0 == ~cond; {1317#false} is VALID [2018-11-18 22:43:20,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-18 22:43:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:43:20,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:20,742 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:43:20,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:20,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:20,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:20,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-18 22:43:20,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1316#true} is VALID [2018-11-18 22:43:20,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1316#true} {1316#true} #126#return; {1316#true} is VALID [2018-11-18 22:43:20,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {1316#true} call #t~ret16 := main(); {1316#true} is VALID [2018-11-18 22:43:20,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {1316#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1316#true} is VALID [2018-11-18 22:43:20,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {1316#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1316#true} is VALID [2018-11-18 22:43:20,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {1316#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1316#true} is VALID [2018-11-18 22:43:20,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {1316#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1316#true} is VALID [2018-11-18 22:43:20,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {1316#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1316#true} is VALID [2018-11-18 22:43:20,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {1316#true} assume !(~a~0 < 100000); {1316#true} is VALID [2018-11-18 22:43:20,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {1316#true} havoc ~i~0;~i~0 := 0; {1316#true} is VALID [2018-11-18 22:43:20,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1316#true} is VALID [2018-11-18 22:43:20,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1316#true} is VALID [2018-11-18 22:43:20,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-18 22:43:20,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#true} ~i~0 := 0; {1316#true} is VALID [2018-11-18 22:43:20,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1316#true} is VALID [2018-11-18 22:43:20,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {1316#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1316#true} is VALID [2018-11-18 22:43:20,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-18 22:43:20,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {1316#true} ~i~0 := 0; {1316#true} is VALID [2018-11-18 22:43:20,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1316#true} is VALID [2018-11-18 22:43:20,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {1316#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1316#true} is VALID [2018-11-18 22:43:20,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-18 22:43:20,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-18 22:43:20,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {1316#true} ~i~0 := 0; {1420#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {1420#(<= main_~i~0 0)} assume true; {1420#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {1420#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1420#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {1420#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1430#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {1430#(<= main_~i~0 1)} assume true; {1430#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {1430#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1317#false} is VALID [2018-11-18 22:43:20,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {1317#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1317#false} is VALID [2018-11-18 22:43:20,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-18 22:43:20,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {1317#false} havoc ~x~0;~x~0 := 0; {1317#false} is VALID [2018-11-18 22:43:20,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-18 22:43:20,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {1317#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1317#false} is VALID [2018-11-18 22:43:20,963 INFO L256 TraceCheckUtils]: 47: Hoare triple {1317#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1317#false} is VALID [2018-11-18 22:43:20,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {1317#false} ~cond := #in~cond; {1317#false} is VALID [2018-11-18 22:43:20,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {1317#false} assume 0 == ~cond; {1317#false} is VALID [2018-11-18 22:43:20,964 INFO L273 TraceCheckUtils]: 50: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-18 22:43:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:43:20,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:20,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 22:43:20,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-18 22:43:20,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:20,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:43:21,097 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:43:21,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:43:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:43:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:43:21,098 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 7 states. [2018-11-18 22:43:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,605 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-11-18 22:43:21,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:21,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-18 22:43:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-18 22:43:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-18 22:43:21,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-18 22:43:21,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:21,865 INFO L225 Difference]: With dead ends: 122 [2018-11-18 22:43:21,865 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 22:43:21,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:43:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 22:43:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-18 22:43:21,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:21,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 74 states. [2018-11-18 22:43:21,899 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 74 states. [2018-11-18 22:43:21,899 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 74 states. [2018-11-18 22:43:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,903 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-18 22:43:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-11-18 22:43:21,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,904 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 80 states. [2018-11-18 22:43:21,904 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 80 states. [2018-11-18 22:43:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,908 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-18 22:43:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-11-18 22:43:21,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:21,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 22:43:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-18 22:43:21,912 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-18 22:43:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:21,913 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-18 22:43:21,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:43:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-18 22:43:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 22:43:21,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:21,915 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:21,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:21,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash 990634025, now seen corresponding path program 3 times [2018-11-18 22:43:21,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:21,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-18 22:43:22,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1896#true} is VALID [2018-11-18 22:43:22,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #126#return; {1896#true} is VALID [2018-11-18 22:43:22,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret16 := main(); {1896#true} is VALID [2018-11-18 22:43:22,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {1896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1898#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {1898#(= main_~a~0 0)} assume true; {1898#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {1898#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1898#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1899#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {1899#(<= main_~a~0 1)} assume true; {1899#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {1899#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1899#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {1899#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1900#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {1900#(<= main_~a~0 2)} assume true; {1900#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {1900#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1900#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1901#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {1901#(<= main_~a~0 3)} assume true; {1901#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {1901#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {1897#false} havoc ~i~0;~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1897#false} is VALID [2018-11-18 22:43:22,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1897#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1897#false} is VALID [2018-11-18 22:43:22,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1897#false} is VALID [2018-11-18 22:43:22,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {1897#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1897#false} is VALID [2018-11-18 22:43:22,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,122 INFO L273 TraceCheckUtils]: 25: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1897#false} is VALID [2018-11-18 22:43:22,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {1897#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1897#false} is VALID [2018-11-18 22:43:22,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1897#false} is VALID [2018-11-18 22:43:22,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {1897#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1897#false} is VALID [2018-11-18 22:43:22,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 38: Hoare triple {1897#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {1897#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-18 22:43:22,127 INFO L273 TraceCheckUtils]: 47: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1897#false} is VALID [2018-11-18 22:43:22,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,128 INFO L273 TraceCheckUtils]: 49: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-18 22:43:22,128 INFO L273 TraceCheckUtils]: 50: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1897#false} is VALID [2018-11-18 22:43:22,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 54: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-18 22:43:22,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1897#false} is VALID [2018-11-18 22:43:22,130 INFO L273 TraceCheckUtils]: 60: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {1897#false} havoc ~x~0;~x~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,130 INFO L273 TraceCheckUtils]: 63: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {1897#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1897#false} is VALID [2018-11-18 22:43:22,131 INFO L256 TraceCheckUtils]: 65: Hoare triple {1897#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1897#false} is VALID [2018-11-18 22:43:22,131 INFO L273 TraceCheckUtils]: 66: Hoare triple {1897#false} ~cond := #in~cond; {1897#false} is VALID [2018-11-18 22:43:22,131 INFO L273 TraceCheckUtils]: 67: Hoare triple {1897#false} assume 0 == ~cond; {1897#false} is VALID [2018-11-18 22:43:22,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-18 22:43:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 22:43:22,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:22,137 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:43:22,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:22,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 22:43:22,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:22,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-18 22:43:22,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1896#true} is VALID [2018-11-18 22:43:22,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #126#return; {1896#true} is VALID [2018-11-18 22:43:22,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret16 := main(); {1896#true} is VALID [2018-11-18 22:43:22,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {1896#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1896#true} is VALID [2018-11-18 22:43:22,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-18 22:43:22,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1896#true} is VALID [2018-11-18 22:43:22,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {1896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-18 22:43:22,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1896#true} is VALID [2018-11-18 22:43:22,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {1896#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-18 22:43:22,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1896#true} is VALID [2018-11-18 22:43:22,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {1896#true} assume !(~a~0 < 100000); {1896#true} is VALID [2018-11-18 22:43:22,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {1896#true} havoc ~i~0;~i~0 := 0; {1896#true} is VALID [2018-11-18 22:43:22,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1896#true} is VALID [2018-11-18 22:43:22,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {1896#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1896#true} is VALID [2018-11-18 22:43:22,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1896#true} is VALID [2018-11-18 22:43:22,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {1896#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1896#true} is VALID [2018-11-18 22:43:22,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {1896#true} assume !(~i~0 < 100000); {1896#true} is VALID [2018-11-18 22:43:22,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {1896#true} ~i~0 := 0; {1896#true} is VALID [2018-11-18 22:43:22,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1896#true} is VALID [2018-11-18 22:43:22,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {1896#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1896#true} is VALID [2018-11-18 22:43:22,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1896#true} is VALID [2018-11-18 22:43:22,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {1896#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1896#true} is VALID [2018-11-18 22:43:22,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-18 22:43:22,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {1896#true} assume !(~i~0 < 100000); {1896#true} is VALID [2018-11-18 22:43:22,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {1896#true} ~i~0 := 0; {2010#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {2010#(<= main_~i~0 0)} assume true; {2010#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {2010#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2010#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {2010#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2020#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {2020#(<= main_~i~0 1)} assume true; {2020#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {2020#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2020#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {2020#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2030#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:22,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {2030#(<= main_~i~0 2)} assume true; {2030#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:22,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {2030#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,543 INFO L273 TraceCheckUtils]: 46: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-18 22:43:22,543 INFO L273 TraceCheckUtils]: 47: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1897#false} is VALID [2018-11-18 22:43:22,543 INFO L273 TraceCheckUtils]: 48: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,543 INFO L273 TraceCheckUtils]: 49: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-18 22:43:22,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1897#false} is VALID [2018-11-18 22:43:22,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,544 INFO L273 TraceCheckUtils]: 52: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,544 INFO L273 TraceCheckUtils]: 53: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,544 INFO L273 TraceCheckUtils]: 54: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 55: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 56: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 57: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 58: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 59: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1897#false} is VALID [2018-11-18 22:43:22,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L273 TraceCheckUtils]: 61: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L273 TraceCheckUtils]: 62: Hoare triple {1897#false} havoc ~x~0;~x~0 := 0; {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L273 TraceCheckUtils]: 63: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {1897#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L256 TraceCheckUtils]: 65: Hoare triple {1897#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {1897#false} is VALID [2018-11-18 22:43:22,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {1897#false} ~cond := #in~cond; {1897#false} is VALID [2018-11-18 22:43:22,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {1897#false} assume 0 == ~cond; {1897#false} is VALID [2018-11-18 22:43:22,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-18 22:43:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 22:43:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:22,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-18 22:43:22,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-18 22:43:22,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:22,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:43:22,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:43:22,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:43:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:22,650 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-11-18 22:43:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,423 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-11-18 22:43:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:43:23,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-18 22:43:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-18 22:43:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-18 22:43:23,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2018-11-18 22:43:23,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:23,720 INFO L225 Difference]: With dead ends: 155 [2018-11-18 22:43:23,720 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 22:43:23,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 22:43:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-11-18 22:43:23,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:23,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 92 states. [2018-11-18 22:43:23,787 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 92 states. [2018-11-18 22:43:23,787 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 92 states. [2018-11-18 22:43:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,791 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-18 22:43:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-11-18 22:43:23,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:23,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:23,792 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 98 states. [2018-11-18 22:43:23,792 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 98 states. [2018-11-18 22:43:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,795 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-18 22:43:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-11-18 22:43:23,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:23,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:23,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:23,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:43:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-11-18 22:43:23,799 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 69 [2018-11-18 22:43:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:23,800 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-11-18 22:43:23,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:43:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-11-18 22:43:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 22:43:23,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:23,801 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:23,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:23,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1388615872, now seen corresponding path program 4 times [2018-11-18 22:43:23,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:23,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:23,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {2636#true} call ULTIMATE.init(); {2636#true} is VALID [2018-11-18 22:43:23,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {2636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2636#true} is VALID [2018-11-18 22:43:23,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {2636#true} assume true; {2636#true} is VALID [2018-11-18 22:43:23,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2636#true} {2636#true} #126#return; {2636#true} is VALID [2018-11-18 22:43:23,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {2636#true} call #t~ret16 := main(); {2636#true} is VALID [2018-11-18 22:43:23,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {2636#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2638#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(= main_~a~0 0)} assume true; {2638#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {2638#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2638#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#(<= main_~a~0 1)} assume true; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,001 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~a~0 2)} assume true; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {2640#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~a~0 3)} assume true; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {2641#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {2641#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2642#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {2642#(<= main_~a~0 4)} assume true; {2642#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {2637#false} havoc ~i~0;~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,007 INFO L273 TraceCheckUtils]: 29: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 32: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 42: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,009 INFO L273 TraceCheckUtils]: 43: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 45: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 46: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 47: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 48: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 49: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 53: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 55: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 56: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 57: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,011 INFO L273 TraceCheckUtils]: 58: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 59: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 61: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 62: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 63: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 64: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 70: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 72: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,013 INFO L273 TraceCheckUtils]: 73: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 74: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 75: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 76: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 77: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 78: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 79: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {2637#false} havoc ~x~0;~x~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L273 TraceCheckUtils]: 81: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {2637#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L256 TraceCheckUtils]: 83: Hoare triple {2637#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L273 TraceCheckUtils]: 84: Hoare triple {2637#false} ~cond := #in~cond; {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L273 TraceCheckUtils]: 85: Hoare triple {2637#false} assume 0 == ~cond; {2637#false} is VALID [2018-11-18 22:43:24,015 INFO L273 TraceCheckUtils]: 86: Hoare triple {2637#false} assume !false; {2637#false} is VALID [2018-11-18 22:43:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 22:43:24,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:24,019 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:43:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:24,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:24,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:24,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {2636#true} call ULTIMATE.init(); {2636#true} is VALID [2018-11-18 22:43:24,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {2636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2636#true} is VALID [2018-11-18 22:43:24,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {2636#true} assume true; {2636#true} is VALID [2018-11-18 22:43:24,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2636#true} {2636#true} #126#return; {2636#true} is VALID [2018-11-18 22:43:24,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {2636#true} call #t~ret16 := main(); {2636#true} is VALID [2018-11-18 22:43:24,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {2636#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2661#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {2661#(<= main_~a~0 0)} assume true; {2661#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {2661#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2661#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {2661#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#(<= main_~a~0 1)} assume true; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2639#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~a~0 2)} assume true; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2640#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {2640#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~a~0 3)} assume true; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {2641#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2641#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {2641#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2642#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {2642#(<= main_~a~0 4)} assume true; {2642#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {2637#false} havoc ~i~0;~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-18 22:43:24,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2637#false} is VALID [2018-11-18 22:43:24,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-18 22:43:24,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2637#false} is VALID [2018-11-18 22:43:24,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 50: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 51: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 52: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 58: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 60: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,687 INFO L273 TraceCheckUtils]: 61: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,688 INFO L273 TraceCheckUtils]: 62: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-18 22:43:24,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2637#false} is VALID [2018-11-18 22:43:24,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 67: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 68: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 69: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 70: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 71: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,689 INFO L273 TraceCheckUtils]: 72: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 73: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 74: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2637#false} is VALID [2018-11-18 22:43:24,690 INFO L273 TraceCheckUtils]: 78: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {2637#false} havoc ~x~0;~x~0 := 0; {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L273 TraceCheckUtils]: 82: Hoare triple {2637#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L256 TraceCheckUtils]: 83: Hoare triple {2637#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {2637#false} is VALID [2018-11-18 22:43:24,691 INFO L273 TraceCheckUtils]: 84: Hoare triple {2637#false} ~cond := #in~cond; {2637#false} is VALID [2018-11-18 22:43:24,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {2637#false} assume 0 == ~cond; {2637#false} is VALID [2018-11-18 22:43:24,692 INFO L273 TraceCheckUtils]: 86: Hoare triple {2637#false} assume !false; {2637#false} is VALID [2018-11-18 22:43:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 22:43:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:24,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:43:24,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-18 22:43:24,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:24,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:43:24,847 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:43:24,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:43:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:43:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:24,848 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 8 states. [2018-11-18 22:43:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,286 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-11-18 22:43:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:25,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-18 22:43:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-18 22:43:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-18 22:43:25,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2018-11-18 22:43:25,524 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:43:25,526 INFO L225 Difference]: With dead ends: 168 [2018-11-18 22:43:25,527 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 22:43:25,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 22:43:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-18 22:43:25,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:25,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:25,578 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:25,578 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,581 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-18 22:43:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-11-18 22:43:25,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,582 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-18 22:43:25,582 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-18 22:43:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,584 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-18 22:43:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-11-18 22:43:25,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:25,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:43:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-11-18 22:43:25,588 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 87 [2018-11-18 22:43:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:25,589 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-11-18 22:43:25,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:43:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-18 22:43:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:43:25,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:25,590 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:25,590 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:25,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1862353795, now seen corresponding path program 5 times [2018-11-18 22:43:25,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:25,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:25,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-18 22:43:25,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3448#true} is VALID [2018-11-18 22:43:25,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:25,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #126#return; {3448#true} is VALID [2018-11-18 22:43:25,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret16 := main(); {3448#true} is VALID [2018-11-18 22:43:25,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3450#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {3450#(= main_~a~0 0)} assume true; {3450#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {3450#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3450#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {3450#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3451#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {3451#(<= main_~a~0 1)} assume true; {3451#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {3451#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3451#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {3451#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3452#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {3452#(<= main_~a~0 2)} assume true; {3452#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {3452#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3452#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {3452#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3453#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {3453#(<= main_~a~0 3)} assume true; {3453#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {3453#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3453#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {3453#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3454#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {3454#(<= main_~a~0 4)} assume true; {3454#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {3454#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3454#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {3454#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3455#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:25,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {3455#(<= main_~a~0 5)} assume true; {3455#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:25,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {3455#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {3449#false} havoc ~i~0;~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-18 22:43:25,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3449#false} is VALID [2018-11-18 22:43:25,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-18 22:43:25,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3449#false} is VALID [2018-11-18 22:43:25,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-18 22:43:25,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3449#false} is VALID [2018-11-18 22:43:25,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 40: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 44: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 45: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 48: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:25,799 INFO L273 TraceCheckUtils]: 51: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 52: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 53: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 54: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 55: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 56: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 57: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 59: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 61: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 63: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 64: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 65: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:25,801 INFO L273 TraceCheckUtils]: 66: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 67: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 68: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 70: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 71: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,802 INFO L273 TraceCheckUtils]: 72: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,803 INFO L273 TraceCheckUtils]: 73: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:25,803 INFO L273 TraceCheckUtils]: 74: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:25,803 INFO L273 TraceCheckUtils]: 75: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,803 INFO L273 TraceCheckUtils]: 76: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:25,803 INFO L273 TraceCheckUtils]: 77: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 78: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 79: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 80: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 81: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 82: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:25,804 INFO L273 TraceCheckUtils]: 83: Hoare triple {3449#false} havoc ~x~0;~x~0 := 0; {3449#false} is VALID [2018-11-18 22:43:25,805 INFO L273 TraceCheckUtils]: 84: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:25,805 INFO L273 TraceCheckUtils]: 85: Hoare triple {3449#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3449#false} is VALID [2018-11-18 22:43:25,805 INFO L256 TraceCheckUtils]: 86: Hoare triple {3449#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3449#false} is VALID [2018-11-18 22:43:25,805 INFO L273 TraceCheckUtils]: 87: Hoare triple {3449#false} ~cond := #in~cond; {3449#false} is VALID [2018-11-18 22:43:25,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {3449#false} assume 0 == ~cond; {3449#false} is VALID [2018-11-18 22:43:25,806 INFO L273 TraceCheckUtils]: 89: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-18 22:43:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 22:43:25,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:25,810 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:43:25,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:39,136 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:43:39,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:39,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:39,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #126#return; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret16 := main(); {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {3448#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-18 22:43:39,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {3448#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {3448#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3448#true} is VALID [2018-11-18 22:43:39,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {3448#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {3448#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {3448#true} assume !(~a~0 < 100000); {3448#true} is VALID [2018-11-18 22:43:39,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {3448#true} havoc ~i~0;~i~0 := 0; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3448#true} is VALID [2018-11-18 22:43:39,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-18 22:43:39,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3448#true} is VALID [2018-11-18 22:43:39,594 INFO L273 TraceCheckUtils]: 33: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-18 22:43:39,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {3448#true} assume !(~i~0 < 100000); {3448#true} is VALID [2018-11-18 22:43:39,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {3448#true} ~i~0 := 0; {3564#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:39,601 INFO L273 TraceCheckUtils]: 36: Hoare triple {3564#(<= main_~i~0 0)} assume true; {3564#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:39,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {3564#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3564#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:39,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {3564#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3574#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:39,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {3574#(<= main_~i~0 1)} assume true; {3574#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:39,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {3574#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3574#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:39,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {3574#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3584#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:39,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {3584#(<= main_~i~0 2)} assume true; {3584#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:39,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {3584#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3584#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:39,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {3584#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3594#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:39,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {3594#(<= main_~i~0 3)} assume true; {3594#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:39,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {3594#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:39,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:39,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:39,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:39,607 INFO L273 TraceCheckUtils]: 51: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,607 INFO L273 TraceCheckUtils]: 52: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:39,607 INFO L273 TraceCheckUtils]: 53: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:39,607 INFO L273 TraceCheckUtils]: 54: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,607 INFO L273 TraceCheckUtils]: 55: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-18 22:43:39,608 INFO L273 TraceCheckUtils]: 56: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3449#false} is VALID [2018-11-18 22:43:39,608 INFO L273 TraceCheckUtils]: 57: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,608 INFO L273 TraceCheckUtils]: 58: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:39,608 INFO L273 TraceCheckUtils]: 59: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:39,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 64: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 65: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:39,609 INFO L273 TraceCheckUtils]: 66: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 67: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 68: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 69: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 70: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 71: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 72: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 73: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:39,610 INFO L273 TraceCheckUtils]: 74: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 75: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 76: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 77: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 78: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 79: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 80: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 81: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,611 INFO L273 TraceCheckUtils]: 82: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 83: Hoare triple {3449#false} havoc ~x~0;~x~0 := 0; {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 84: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 85: Hoare triple {3449#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L256 TraceCheckUtils]: 86: Hoare triple {3449#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 87: Hoare triple {3449#false} ~cond := #in~cond; {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 88: Hoare triple {3449#false} assume 0 == ~cond; {3449#false} is VALID [2018-11-18 22:43:39,612 INFO L273 TraceCheckUtils]: 89: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-18 22:43:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 22:43:39,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:39,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-18 22:43:39,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-18 22:43:39,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:39,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:39,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:39,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:39,715 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 12 states. [2018-11-18 22:43:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:40,711 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-11-18 22:43:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:43:40,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-18 22:43:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-18 22:43:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-18 22:43:40,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 168 transitions. [2018-11-18 22:43:41,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:41,041 INFO L225 Difference]: With dead ends: 191 [2018-11-18 22:43:41,041 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 22:43:41,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 22:43:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-11-18 22:43:41,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:41,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 113 states. [2018-11-18 22:43:41,132 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 113 states. [2018-11-18 22:43:41,132 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 113 states. [2018-11-18 22:43:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:41,136 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-18 22:43:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-18 22:43:41,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:41,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:41,137 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 119 states. [2018-11-18 22:43:41,137 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 119 states. [2018-11-18 22:43:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:41,140 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-18 22:43:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-18 22:43:41,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:41,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:41,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:41,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 22:43:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-11-18 22:43:41,144 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 90 [2018-11-18 22:43:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:41,145 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-11-18 22:43:41,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-18 22:43:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 22:43:41,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:41,146 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:41,147 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:41,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -828151924, now seen corresponding path program 6 times [2018-11-18 22:43:41,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:41,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:41,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:41,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2018-11-18 22:43:41,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4372#true} is VALID [2018-11-18 22:43:41,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2018-11-18 22:43:41,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #126#return; {4372#true} is VALID [2018-11-18 22:43:41,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret16 := main(); {4372#true} is VALID [2018-11-18 22:43:41,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {4372#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4374#(= main_~a~0 0)} is VALID [2018-11-18 22:43:41,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {4374#(= main_~a~0 0)} assume true; {4374#(= main_~a~0 0)} is VALID [2018-11-18 22:43:41,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {4374#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4374#(= main_~a~0 0)} is VALID [2018-11-18 22:43:41,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {4374#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:41,927 INFO L273 TraceCheckUtils]: 9: Hoare triple {4375#(<= main_~a~0 1)} assume true; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:41,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {4375#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:41,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {4375#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:41,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {4376#(<= main_~a~0 2)} assume true; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:41,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {4376#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:41,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {4376#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:41,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {4377#(<= main_~a~0 3)} assume true; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:41,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {4377#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:41,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {4377#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:41,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {4378#(<= main_~a~0 4)} assume true; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:41,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {4378#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:41,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:41,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {4379#(<= main_~a~0 5)} assume true; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:41,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {4379#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:41,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4380#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:41,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~a~0 6)} assume true; {4380#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {4373#false} havoc ~i~0;~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:41,971 INFO L273 TraceCheckUtils]: 38: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:41,972 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:41,973 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:41,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:41,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 53: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 54: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,974 INFO L273 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 56: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 57: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 59: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 60: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 62: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,976 INFO L273 TraceCheckUtils]: 67: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:41,977 INFO L273 TraceCheckUtils]: 68: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:41,977 INFO L273 TraceCheckUtils]: 69: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,977 INFO L273 TraceCheckUtils]: 70: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,977 INFO L273 TraceCheckUtils]: 71: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,977 INFO L273 TraceCheckUtils]: 72: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 74: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 75: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 76: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 77: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:41,978 INFO L273 TraceCheckUtils]: 78: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,979 INFO L273 TraceCheckUtils]: 79: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:41,979 INFO L273 TraceCheckUtils]: 80: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:41,979 INFO L273 TraceCheckUtils]: 81: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,979 INFO L273 TraceCheckUtils]: 82: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:41,979 INFO L273 TraceCheckUtils]: 83: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 85: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 87: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 88: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:41,980 INFO L273 TraceCheckUtils]: 89: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:41,981 INFO L273 TraceCheckUtils]: 90: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:41,981 INFO L273 TraceCheckUtils]: 92: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:41,981 INFO L273 TraceCheckUtils]: 93: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,981 INFO L273 TraceCheckUtils]: 94: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 95: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 96: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:41,983 INFO L273 TraceCheckUtils]: 101: Hoare triple {4373#false} havoc ~x~0;~x~0 := 0; {4373#false} is VALID [2018-11-18 22:43:41,983 INFO L273 TraceCheckUtils]: 102: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:41,983 INFO L273 TraceCheckUtils]: 103: Hoare triple {4373#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4373#false} is VALID [2018-11-18 22:43:41,983 INFO L256 TraceCheckUtils]: 104: Hoare triple {4373#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {4373#false} is VALID [2018-11-18 22:43:41,983 INFO L273 TraceCheckUtils]: 105: Hoare triple {4373#false} ~cond := #in~cond; {4373#false} is VALID [2018-11-18 22:43:41,984 INFO L273 TraceCheckUtils]: 106: Hoare triple {4373#false} assume 0 == ~cond; {4373#false} is VALID [2018-11-18 22:43:41,984 INFO L273 TraceCheckUtils]: 107: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2018-11-18 22:43:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:41,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:41,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 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:43:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:43,833 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:43:43,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:43,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:44,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2018-11-18 22:43:44,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4372#true} is VALID [2018-11-18 22:43:44,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2018-11-18 22:43:44,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #126#return; {4372#true} is VALID [2018-11-18 22:43:44,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret16 := main(); {4372#true} is VALID [2018-11-18 22:43:44,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {4372#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4399#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:44,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {4399#(<= main_~a~0 0)} assume true; {4399#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:44,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {4399#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4399#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:44,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {4399#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {4375#(<= main_~a~0 1)} assume true; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {4375#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4375#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {4375#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,044 INFO L273 TraceCheckUtils]: 12: Hoare triple {4376#(<= main_~a~0 2)} assume true; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {4376#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4376#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {4376#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {4377#(<= main_~a~0 3)} assume true; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {4377#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4377#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {4377#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {4378#(<= main_~a~0 4)} assume true; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {4378#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4378#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {4379#(<= main_~a~0 5)} assume true; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {4379#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4379#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4380#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~a~0 6)} assume true; {4380#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {4373#false} havoc ~i~0;~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:44,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:44,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,053 INFO L273 TraceCheckUtils]: 31: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:44,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:44,054 INFO L273 TraceCheckUtils]: 33: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:44,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:44,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,054 INFO L273 TraceCheckUtils]: 37: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:44,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 46: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 51: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 52: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-18 22:43:44,056 INFO L273 TraceCheckUtils]: 53: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 54: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 56: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 57: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 58: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 59: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 60: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:44,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 65: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 66: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 67: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 68: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 69: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 71: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 73: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 74: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 75: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 76: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 77: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 78: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,059 INFO L273 TraceCheckUtils]: 79: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 80: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 81: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 82: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 84: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 85: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 86: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,060 INFO L273 TraceCheckUtils]: 87: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 88: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 89: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 90: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 92: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 93: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 94: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:44,061 INFO L273 TraceCheckUtils]: 95: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:44,062 INFO L273 TraceCheckUtils]: 96: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,062 INFO L273 TraceCheckUtils]: 97: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-18 22:43:44,062 INFO L273 TraceCheckUtils]: 98: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4373#false} is VALID [2018-11-18 22:43:44,062 INFO L273 TraceCheckUtils]: 99: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,062 INFO L273 TraceCheckUtils]: 100: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 101: Hoare triple {4373#false} havoc ~x~0;~x~0 := 0; {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 102: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 103: Hoare triple {4373#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L256 TraceCheckUtils]: 104: Hoare triple {4373#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 105: Hoare triple {4373#false} ~cond := #in~cond; {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 106: Hoare triple {4373#false} assume 0 == ~cond; {4373#false} is VALID [2018-11-18 22:43:44,063 INFO L273 TraceCheckUtils]: 107: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2018-11-18 22:43:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:44,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:43:44,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-11-18 22:43:44,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:44,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:43:44,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:44,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:43:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:43:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:43:44,205 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 10 states. [2018-11-18 22:43:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,553 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-11-18 22:43:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:43:44,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-11-18 22:43:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-18 22:43:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-18 22:43:44,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2018-11-18 22:43:44,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:44,662 INFO L225 Difference]: With dead ends: 204 [2018-11-18 22:43:44,663 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 22:43:44,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:43:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 22:43:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-18 22:43:44,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:44,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 116 states. [2018-11-18 22:43:44,704 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 116 states. [2018-11-18 22:43:44,704 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 116 states. [2018-11-18 22:43:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,708 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-18 22:43:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-18 22:43:44,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:44,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:44,709 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 117 states. [2018-11-18 22:43:44,709 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 117 states. [2018-11-18 22:43:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,712 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-18 22:43:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-18 22:43:44,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:44,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:44,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:44,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 22:43:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-11-18 22:43:44,715 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 108 [2018-11-18 22:43:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:44,716 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-11-18 22:43:44,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:43:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-11-18 22:43:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 22:43:44,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:44,717 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:44,718 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:44,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 900867241, now seen corresponding path program 7 times [2018-11-18 22:43:44,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:44,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:44,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2018-11-18 22:43:44,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {5367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5367#true} is VALID [2018-11-18 22:43:44,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2018-11-18 22:43:44,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #126#return; {5367#true} is VALID [2018-11-18 22:43:44,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret16 := main(); {5367#true} is VALID [2018-11-18 22:43:44,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {5367#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5369#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {5369#(= main_~a~0 0)} assume true; {5369#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {5369#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {5369#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {5370#(<= main_~a~0 1)} assume true; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {5370#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {5370#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {5371#(<= main_~a~0 2)} assume true; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {5371#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {5371#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {5372#(<= main_~a~0 3)} assume true; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {5372#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {5373#(<= main_~a~0 4)} assume true; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {5373#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {5373#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {5374#(<= main_~a~0 5)} assume true; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {5374#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~a~0 6)} assume true; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {5375#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {5375#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5376#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:44,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {5376#(<= main_~a~0 7)} assume true; {5376#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:44,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {5376#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {5368#false} havoc ~i~0;~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:44,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:44,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,952 INFO L273 TraceCheckUtils]: 34: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:44,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:44,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:44,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:44,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,953 INFO L273 TraceCheckUtils]: 40: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 45: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,954 INFO L273 TraceCheckUtils]: 46: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 47: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 48: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 49: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 50: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:44,955 INFO L273 TraceCheckUtils]: 53: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:44,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,956 INFO L273 TraceCheckUtils]: 55: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:44,956 INFO L273 TraceCheckUtils]: 56: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:44,956 INFO L273 TraceCheckUtils]: 57: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,956 INFO L273 TraceCheckUtils]: 58: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,957 INFO L273 TraceCheckUtils]: 61: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:44,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:44,957 INFO L273 TraceCheckUtils]: 63: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:44,958 INFO L273 TraceCheckUtils]: 65: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:44,958 INFO L273 TraceCheckUtils]: 66: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,958 INFO L273 TraceCheckUtils]: 67: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:44,958 INFO L273 TraceCheckUtils]: 68: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:44,959 INFO L273 TraceCheckUtils]: 69: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,959 INFO L273 TraceCheckUtils]: 70: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:44,959 INFO L273 TraceCheckUtils]: 71: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:44,959 INFO L273 TraceCheckUtils]: 72: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,959 INFO L273 TraceCheckUtils]: 73: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,960 INFO L273 TraceCheckUtils]: 74: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,960 INFO L273 TraceCheckUtils]: 75: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,960 INFO L273 TraceCheckUtils]: 76: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:44,960 INFO L273 TraceCheckUtils]: 77: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:44,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:44,961 INFO L273 TraceCheckUtils]: 80: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:44,961 INFO L273 TraceCheckUtils]: 81: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,961 INFO L273 TraceCheckUtils]: 82: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:44,962 INFO L273 TraceCheckUtils]: 83: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:44,962 INFO L273 TraceCheckUtils]: 84: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:44,962 INFO L273 TraceCheckUtils]: 86: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:44,962 INFO L273 TraceCheckUtils]: 87: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,963 INFO L273 TraceCheckUtils]: 88: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,963 INFO L273 TraceCheckUtils]: 89: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,963 INFO L273 TraceCheckUtils]: 90: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,963 INFO L273 TraceCheckUtils]: 91: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:44,963 INFO L273 TraceCheckUtils]: 92: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:44,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:44,964 INFO L273 TraceCheckUtils]: 95: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:44,964 INFO L273 TraceCheckUtils]: 96: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,964 INFO L273 TraceCheckUtils]: 97: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:44,965 INFO L273 TraceCheckUtils]: 98: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:44,965 INFO L273 TraceCheckUtils]: 99: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,965 INFO L273 TraceCheckUtils]: 100: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:44,965 INFO L273 TraceCheckUtils]: 101: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:44,965 INFO L273 TraceCheckUtils]: 102: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:44,966 INFO L273 TraceCheckUtils]: 104: Hoare triple {5368#false} havoc ~x~0;~x~0 := 0; {5368#false} is VALID [2018-11-18 22:43:44,966 INFO L273 TraceCheckUtils]: 105: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:44,966 INFO L273 TraceCheckUtils]: 106: Hoare triple {5368#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5368#false} is VALID [2018-11-18 22:43:44,966 INFO L256 TraceCheckUtils]: 107: Hoare triple {5368#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {5368#false} is VALID [2018-11-18 22:43:44,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {5368#false} ~cond := #in~cond; {5368#false} is VALID [2018-11-18 22:43:44,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {5368#false} assume 0 == ~cond; {5368#false} is VALID [2018-11-18 22:43:44,967 INFO L273 TraceCheckUtils]: 110: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2018-11-18 22:43:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:44,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:44,980 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:43:44,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:45,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:45,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2018-11-18 22:43:45,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {5367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5367#true} is VALID [2018-11-18 22:43:45,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2018-11-18 22:43:45,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #126#return; {5367#true} is VALID [2018-11-18 22:43:45,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret16 := main(); {5367#true} is VALID [2018-11-18 22:43:45,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {5367#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5395#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:45,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {5395#(<= main_~a~0 0)} assume true; {5395#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:45,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {5395#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5395#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:45,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {5395#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:45,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {5370#(<= main_~a~0 1)} assume true; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:45,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {5370#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5370#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:45,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {5370#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:45,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {5371#(<= main_~a~0 2)} assume true; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:45,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {5371#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5371#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:45,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {5371#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:45,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {5372#(<= main_~a~0 3)} assume true; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:45,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5372#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:45,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {5372#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:45,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {5373#(<= main_~a~0 4)} assume true; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:45,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {5373#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5373#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:45,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {5373#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:45,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {5374#(<= main_~a~0 5)} assume true; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:45,259 INFO L273 TraceCheckUtils]: 22: Hoare triple {5374#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5374#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:45,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:45,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~a~0 6)} assume true; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:45,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {5375#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5375#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:45,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {5375#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5376#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:45,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {5376#(<= main_~a~0 7)} assume true; {5376#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:45,263 INFO L273 TraceCheckUtils]: 28: Hoare triple {5376#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {5368#false} havoc ~i~0;~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:45,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:45,264 INFO L273 TraceCheckUtils]: 33: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:45,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:45,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:45,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:45,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-18 22:43:45,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 43: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 44: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 46: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:45,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 48: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 49: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 50: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 51: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 53: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:45,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 55: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 56: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 57: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 58: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 62: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 63: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 64: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 65: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 66: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,270 INFO L273 TraceCheckUtils]: 67: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 68: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 69: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 70: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 71: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 72: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 73: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,271 INFO L273 TraceCheckUtils]: 74: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 75: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 76: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 77: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 78: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 79: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:45,272 INFO L273 TraceCheckUtils]: 80: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 81: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 82: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 83: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 84: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 85: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 86: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5368#false} is VALID [2018-11-18 22:43:45,273 INFO L273 TraceCheckUtils]: 87: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 88: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 89: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 90: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 91: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 92: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 93: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,274 INFO L273 TraceCheckUtils]: 94: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 95: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 96: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 97: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 98: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 99: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,275 INFO L273 TraceCheckUtils]: 100: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 101: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 102: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 103: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 104: Hoare triple {5368#false} havoc ~x~0;~x~0 := 0; {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 105: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L273 TraceCheckUtils]: 106: Hoare triple {5368#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5368#false} is VALID [2018-11-18 22:43:45,276 INFO L256 TraceCheckUtils]: 107: Hoare triple {5368#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {5368#false} is VALID [2018-11-18 22:43:45,277 INFO L273 TraceCheckUtils]: 108: Hoare triple {5368#false} ~cond := #in~cond; {5368#false} is VALID [2018-11-18 22:43:45,277 INFO L273 TraceCheckUtils]: 109: Hoare triple {5368#false} assume 0 == ~cond; {5368#false} is VALID [2018-11-18 22:43:45,277 INFO L273 TraceCheckUtils]: 110: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2018-11-18 22:43:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:45,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:45,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:43:45,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-11-18 22:43:45,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:45,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:43:45,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:45,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:43:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:43:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:45,381 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 11 states. [2018-11-18 22:43:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:45,619 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2018-11-18 22:43:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:43:45,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-11-18 22:43:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-18 22:43:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-18 22:43:45,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2018-11-18 22:43:45,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:45,772 INFO L225 Difference]: With dead ends: 207 [2018-11-18 22:43:45,772 INFO L226 Difference]: Without dead ends: 120 [2018-11-18 22:43:45,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-18 22:43:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-18 22:43:46,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:46,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 119 states. [2018-11-18 22:43:46,265 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 119 states. [2018-11-18 22:43:46,265 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 119 states. [2018-11-18 22:43:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:46,268 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-18 22:43:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-18 22:43:46,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:46,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:46,269 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 120 states. [2018-11-18 22:43:46,269 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 120 states. [2018-11-18 22:43:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:46,272 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-18 22:43:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-18 22:43:46,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:46,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:46,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:46,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 22:43:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-11-18 22:43:46,276 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 111 [2018-11-18 22:43:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:46,276 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-11-18 22:43:46,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:43:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-18 22:43:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:43:46,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:46,278 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:46,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:46,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:46,278 INFO L82 PathProgramCache]: Analyzing trace with hash 568030828, now seen corresponding path program 8 times [2018-11-18 22:43:46,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:46,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:46,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:46,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:46,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:46,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {6386#true} call ULTIMATE.init(); {6386#true} is VALID [2018-11-18 22:43:46,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {6386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6386#true} is VALID [2018-11-18 22:43:46,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {6386#true} assume true; {6386#true} is VALID [2018-11-18 22:43:46,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6386#true} {6386#true} #126#return; {6386#true} is VALID [2018-11-18 22:43:46,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {6386#true} call #t~ret16 := main(); {6386#true} is VALID [2018-11-18 22:43:46,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {6386#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6388#(= main_~a~0 0)} is VALID [2018-11-18 22:43:46,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {6388#(= main_~a~0 0)} assume true; {6388#(= main_~a~0 0)} is VALID [2018-11-18 22:43:46,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {6388#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6388#(= main_~a~0 0)} is VALID [2018-11-18 22:43:46,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {6388#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {6389#(<= main_~a~0 1)} assume true; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {6389#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {6389#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {6390#(<= main_~a~0 2)} assume true; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {6390#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {6390#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {6391#(<= main_~a~0 3)} assume true; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {6391#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {6391#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {6392#(<= main_~a~0 4)} assume true; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {6392#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {6392#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {6393#(<= main_~a~0 5)} assume true; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {6393#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {6393#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {6394#(<= main_~a~0 6)} assume true; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {6394#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {6394#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {6395#(<= main_~a~0 7)} assume true; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {6395#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6396#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:46,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {6396#(<= main_~a~0 8)} assume true; {6396#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:46,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {6396#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,578 INFO L273 TraceCheckUtils]: 32: Hoare triple {6387#false} havoc ~i~0;~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,580 INFO L273 TraceCheckUtils]: 44: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 49: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 50: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 51: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 54: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 55: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 60: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,582 INFO L273 TraceCheckUtils]: 61: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 64: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 68: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,583 INFO L273 TraceCheckUtils]: 69: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 71: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 73: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 74: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 75: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,584 INFO L273 TraceCheckUtils]: 77: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 83: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 84: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,585 INFO L273 TraceCheckUtils]: 85: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 87: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 88: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 89: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 90: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 91: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 92: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,586 INFO L273 TraceCheckUtils]: 93: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 96: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 97: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 98: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 99: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 101: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,587 INFO L273 TraceCheckUtils]: 102: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 103: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 104: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 106: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 107: Hoare triple {6387#false} havoc ~x~0;~x~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 108: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L273 TraceCheckUtils]: 109: Hoare triple {6387#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6387#false} is VALID [2018-11-18 22:43:46,588 INFO L256 TraceCheckUtils]: 110: Hoare triple {6387#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {6387#false} is VALID [2018-11-18 22:43:46,589 INFO L273 TraceCheckUtils]: 111: Hoare triple {6387#false} ~cond := #in~cond; {6387#false} is VALID [2018-11-18 22:43:46,589 INFO L273 TraceCheckUtils]: 112: Hoare triple {6387#false} assume 0 == ~cond; {6387#false} is VALID [2018-11-18 22:43:46,589 INFO L273 TraceCheckUtils]: 113: Hoare triple {6387#false} assume !false; {6387#false} is VALID [2018-11-18 22:43:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:46,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:46,594 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:43:46,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:46,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:46,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:46,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:46,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {6386#true} call ULTIMATE.init(); {6386#true} is VALID [2018-11-18 22:43:46,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {6386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6386#true} is VALID [2018-11-18 22:43:46,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {6386#true} assume true; {6386#true} is VALID [2018-11-18 22:43:46,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6386#true} {6386#true} #126#return; {6386#true} is VALID [2018-11-18 22:43:46,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {6386#true} call #t~ret16 := main(); {6386#true} is VALID [2018-11-18 22:43:46,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {6386#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6415#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:46,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {6415#(<= main_~a~0 0)} assume true; {6415#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:46,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {6415#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6415#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:46,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {6415#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {6389#(<= main_~a~0 1)} assume true; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {6389#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6389#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:46,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {6389#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {6390#(<= main_~a~0 2)} assume true; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {6390#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6390#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:46,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {6390#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {6391#(<= main_~a~0 3)} assume true; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {6391#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6391#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:46,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {6391#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {6392#(<= main_~a~0 4)} assume true; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {6392#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6392#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:46,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {6392#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {6393#(<= main_~a~0 5)} assume true; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {6393#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6393#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:46,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {6393#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {6394#(<= main_~a~0 6)} assume true; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {6394#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6394#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:46,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {6394#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {6395#(<= main_~a~0 7)} assume true; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {6395#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6395#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:46,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6396#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:46,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {6396#(<= main_~a~0 8)} assume true; {6396#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:46,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {6396#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {6387#false} havoc ~i~0;~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 42: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 43: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6387#false} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 45: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 49: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 50: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 52: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 53: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 54: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 55: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 56: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 57: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 58: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 59: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 60: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 61: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 62: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 63: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 69: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 71: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 72: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6387#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 76: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 79: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 80: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 81: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 82: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 85: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 86: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 88: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 89: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 90: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 91: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,845 INFO L273 TraceCheckUtils]: 92: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 93: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 94: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 95: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 96: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 97: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 98: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 99: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,846 INFO L273 TraceCheckUtils]: 100: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 101: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 102: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 103: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 104: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 105: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 106: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 107: Hoare triple {6387#false} havoc ~x~0;~x~0 := 0; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 108: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-18 22:43:46,847 INFO L273 TraceCheckUtils]: 109: Hoare triple {6387#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6387#false} is VALID [2018-11-18 22:43:46,848 INFO L256 TraceCheckUtils]: 110: Hoare triple {6387#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {6387#false} is VALID [2018-11-18 22:43:46,848 INFO L273 TraceCheckUtils]: 111: Hoare triple {6387#false} ~cond := #in~cond; {6387#false} is VALID [2018-11-18 22:43:46,848 INFO L273 TraceCheckUtils]: 112: Hoare triple {6387#false} assume 0 == ~cond; {6387#false} is VALID [2018-11-18 22:43:46,848 INFO L273 TraceCheckUtils]: 113: Hoare triple {6387#false} assume !false; {6387#false} is VALID [2018-11-18 22:43:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:46,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:46,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:43:46,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-11-18 22:43:46,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:46,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:46,941 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:43:46,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:46,942 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 12 states. [2018-11-18 22:43:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:47,525 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-11-18 22:43:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:43:47,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-11-18 22:43:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-18 22:43:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-18 22:43:47,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-18 22:43:48,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:48,059 INFO L225 Difference]: With dead ends: 210 [2018-11-18 22:43:48,059 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 22:43:48,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 22:43:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-18 22:43:48,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:48,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-18 22:43:48,095 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-18 22:43:48,095 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-18 22:43:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:48,099 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-18 22:43:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-18 22:43:48,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:48,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:48,100 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-18 22:43:48,100 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-18 22:43:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:48,103 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-18 22:43:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-18 22:43:48,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:48,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:48,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:48,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:43:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-11-18 22:43:48,107 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 114 [2018-11-18 22:43:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:48,108 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-11-18 22:43:48,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-18 22:43:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 22:43:48,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:48,109 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:48,109 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:48,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2117937609, now seen corresponding path program 9 times [2018-11-18 22:43:48,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:48,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:48,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:48,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {7429#true} call ULTIMATE.init(); {7429#true} is VALID [2018-11-18 22:43:48,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {7429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7429#true} is VALID [2018-11-18 22:43:48,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:48,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7429#true} {7429#true} #126#return; {7429#true} is VALID [2018-11-18 22:43:48,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {7429#true} call #t~ret16 := main(); {7429#true} is VALID [2018-11-18 22:43:48,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {7429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7431#(= main_~a~0 0)} is VALID [2018-11-18 22:43:48,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {7431#(= main_~a~0 0)} assume true; {7431#(= main_~a~0 0)} is VALID [2018-11-18 22:43:48,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {7431#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7431#(= main_~a~0 0)} is VALID [2018-11-18 22:43:48,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {7431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7432#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:48,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {7432#(<= main_~a~0 1)} assume true; {7432#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:48,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {7432#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7432#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:48,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {7432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7433#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:48,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {7433#(<= main_~a~0 2)} assume true; {7433#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:48,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {7433#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7433#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:48,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {7433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7434#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:48,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {7434#(<= main_~a~0 3)} assume true; {7434#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:48,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {7434#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7434#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:48,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {7434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7435#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:48,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {7435#(<= main_~a~0 4)} assume true; {7435#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:48,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {7435#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7435#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:48,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {7435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7436#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:48,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {7436#(<= main_~a~0 5)} assume true; {7436#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:48,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {7436#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7436#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:48,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {7436#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7437#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:48,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {7437#(<= main_~a~0 6)} assume true; {7437#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:48,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {7437#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7437#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:48,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {7437#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7438#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:48,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {7438#(<= main_~a~0 7)} assume true; {7438#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:48,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {7438#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7438#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:48,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {7438#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7439#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:48,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {7439#(<= main_~a~0 8)} assume true; {7439#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:48,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {7439#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7439#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:48,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {7439#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7440#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:48,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {7440#(<= main_~a~0 9)} assume true; {7440#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:48,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {7440#(<= main_~a~0 9)} assume !(~a~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {7430#false} havoc ~i~0;~i~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-18 22:43:48,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7430#false} is VALID [2018-11-18 22:43:48,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-18 22:43:48,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7430#false} is VALID [2018-11-18 22:43:48,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 47: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 48: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 52: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 53: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 60: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 62: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7430#false} is VALID [2018-11-18 22:43:48,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 83: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7430#false} is VALID [2018-11-18 22:43:48,677 INFO L273 TraceCheckUtils]: 84: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 85: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 90: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 91: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-18 22:43:48,678 INFO L273 TraceCheckUtils]: 92: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 95: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 96: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 97: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 98: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 99: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 100: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-18 22:43:48,679 INFO L273 TraceCheckUtils]: 101: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 102: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 103: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 104: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 105: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 106: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 107: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 108: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,680 INFO L273 TraceCheckUtils]: 109: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 110: Hoare triple {7430#false} havoc ~x~0;~x~0 := 0; {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 111: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 112: Hoare triple {7430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L256 TraceCheckUtils]: 113: Hoare triple {7430#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 114: Hoare triple {7430#false} ~cond := #in~cond; {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 115: Hoare triple {7430#false} assume 0 == ~cond; {7430#false} is VALID [2018-11-18 22:43:48,681 INFO L273 TraceCheckUtils]: 116: Hoare triple {7430#false} assume !false; {7430#false} is VALID [2018-11-18 22:43:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 22:43:48,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:48,687 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:43:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:49,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:43:49,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:49,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:49,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {7429#true} call ULTIMATE.init(); {7429#true} is VALID [2018-11-18 22:43:49,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {7429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7429#true} is VALID [2018-11-18 22:43:49,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7429#true} {7429#true} #126#return; {7429#true} is VALID [2018-11-18 22:43:49,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {7429#true} call #t~ret16 := main(); {7429#true} is VALID [2018-11-18 22:43:49,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {7429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7429#true} is VALID [2018-11-18 22:43:49,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,449 INFO L273 TraceCheckUtils]: 27: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-18 22:43:49,450 INFO L273 TraceCheckUtils]: 29: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7429#true} is VALID [2018-11-18 22:43:49,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {7429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7537#(< main_~a~0 100000)} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {7537#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7541#(<= main_~a~0 100000)} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {7541#(<= main_~a~0 100000)} assume true; {7541#(<= main_~a~0 100000)} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {7541#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {7429#true} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {7429#true} havoc ~i~0;~i~0 := 0; {7429#true} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 41: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 42: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7429#true} is VALID [2018-11-18 22:43:49,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 47: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 48: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 49: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 50: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-18 22:43:49,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,454 INFO L273 TraceCheckUtils]: 52: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-18 22:43:49,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7429#true} is VALID [2018-11-18 22:43:49,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,454 INFO L273 TraceCheckUtils]: 55: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-18 22:43:49,454 INFO L273 TraceCheckUtils]: 56: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7429#true} is VALID [2018-11-18 22:43:49,455 INFO L273 TraceCheckUtils]: 57: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-18 22:43:49,455 INFO L273 TraceCheckUtils]: 59: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7429#true} is VALID [2018-11-18 22:43:49,455 INFO L273 TraceCheckUtils]: 60: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,455 INFO L273 TraceCheckUtils]: 61: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 63: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 64: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 66: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 67: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 68: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7429#true} is VALID [2018-11-18 22:43:49,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 72: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 73: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 74: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 75: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,457 INFO L273 TraceCheckUtils]: 76: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7674#(< main_~i~0 100000)} is VALID [2018-11-18 22:43:49,458 INFO L273 TraceCheckUtils]: 77: Hoare triple {7674#(< main_~i~0 100000)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7678#(<= main_~i~0 100000)} is VALID [2018-11-18 22:43:49,458 INFO L273 TraceCheckUtils]: 78: Hoare triple {7678#(<= main_~i~0 100000)} assume true; {7678#(<= main_~i~0 100000)} is VALID [2018-11-18 22:43:49,458 INFO L273 TraceCheckUtils]: 79: Hoare triple {7678#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 80: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 81: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 82: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 83: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 84: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 85: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 87: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,459 INFO L273 TraceCheckUtils]: 88: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 90: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 91: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 92: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 93: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 94: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-18 22:43:49,460 INFO L273 TraceCheckUtils]: 95: Hoare triple {7429#true} ~i~0 := 0; {7733#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:49,461 INFO L273 TraceCheckUtils]: 96: Hoare triple {7733#(<= main_~i~0 0)} assume true; {7733#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:49,461 INFO L273 TraceCheckUtils]: 97: Hoare triple {7733#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7733#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:49,462 INFO L273 TraceCheckUtils]: 98: Hoare triple {7733#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:49,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:49,462 INFO L273 TraceCheckUtils]: 100: Hoare triple {7743#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7743#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:49,463 INFO L273 TraceCheckUtils]: 101: Hoare triple {7743#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7753#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:49,463 INFO L273 TraceCheckUtils]: 102: Hoare triple {7753#(<= main_~i~0 2)} assume true; {7753#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:49,463 INFO L273 TraceCheckUtils]: 103: Hoare triple {7753#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7753#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:49,464 INFO L273 TraceCheckUtils]: 104: Hoare triple {7753#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7763#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:49,464 INFO L273 TraceCheckUtils]: 105: Hoare triple {7763#(<= main_~i~0 3)} assume true; {7763#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:49,465 INFO L273 TraceCheckUtils]: 106: Hoare triple {7763#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7763#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:49,466 INFO L273 TraceCheckUtils]: 107: Hoare triple {7763#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7773#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:49,466 INFO L273 TraceCheckUtils]: 108: Hoare triple {7773#(<= main_~i~0 4)} assume true; {7773#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:49,467 INFO L273 TraceCheckUtils]: 109: Hoare triple {7773#(<= main_~i~0 4)} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-18 22:43:49,467 INFO L273 TraceCheckUtils]: 110: Hoare triple {7430#false} havoc ~x~0;~x~0 := 0; {7430#false} is VALID [2018-11-18 22:43:49,467 INFO L273 TraceCheckUtils]: 111: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-18 22:43:49,468 INFO L273 TraceCheckUtils]: 112: Hoare triple {7430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7430#false} is VALID [2018-11-18 22:43:49,468 INFO L256 TraceCheckUtils]: 113: Hoare triple {7430#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {7430#false} is VALID [2018-11-18 22:43:49,468 INFO L273 TraceCheckUtils]: 114: Hoare triple {7430#false} ~cond := #in~cond; {7430#false} is VALID [2018-11-18 22:43:49,468 INFO L273 TraceCheckUtils]: 115: Hoare triple {7430#false} assume 0 == ~cond; {7430#false} is VALID [2018-11-18 22:43:49,468 INFO L273 TraceCheckUtils]: 116: Hoare triple {7430#false} assume !false; {7430#false} is VALID [2018-11-18 22:43:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-18 22:43:49,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:49,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-18 22:43:49,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-11-18 22:43:49,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:49,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:43:49,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:49,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:43:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:43:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:49,596 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 21 states. [2018-11-18 22:43:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:51,357 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-11-18 22:43:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:43:51,357 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-11-18 22:43:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2018-11-18 22:43:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2018-11-18 22:43:51,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 213 transitions. [2018-11-18 22:43:51,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:51,955 INFO L225 Difference]: With dead ends: 245 [2018-11-18 22:43:51,955 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 22:43:51,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:43:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 22:43:52,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-11-18 22:43:52,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:52,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2018-11-18 22:43:52,030 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-18 22:43:52,031 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-18 22:43:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:52,035 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-11-18 22:43:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-18 22:43:52,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:52,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:52,036 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-18 22:43:52,036 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-18 22:43:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:52,040 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-11-18 22:43:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-18 22:43:52,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:52,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:52,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:52,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:43:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2018-11-18 22:43:52,045 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 117 [2018-11-18 22:43:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:52,045 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2018-11-18 22:43:52,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:43:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-18 22:43:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 22:43:52,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:52,047 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:52,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:52,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1833649879, now seen corresponding path program 10 times [2018-11-18 22:43:52,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:52,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:52,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:52,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:52,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:52,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2018-11-18 22:43:52,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {8676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8676#true} is VALID [2018-11-18 22:43:52,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2018-11-18 22:43:52,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #126#return; {8676#true} is VALID [2018-11-18 22:43:52,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret16 := main(); {8676#true} is VALID [2018-11-18 22:43:52,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {8676#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8678#(= main_~a~0 0)} is VALID [2018-11-18 22:43:52,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {8678#(= main_~a~0 0)} assume true; {8678#(= main_~a~0 0)} is VALID [2018-11-18 22:43:52,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {8678#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8678#(= main_~a~0 0)} is VALID [2018-11-18 22:43:52,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {8678#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:52,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {8679#(<= main_~a~0 1)} assume true; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:52,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {8679#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:52,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {8679#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:52,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {8680#(<= main_~a~0 2)} assume true; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:52,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {8680#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:52,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {8680#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:52,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {8681#(<= main_~a~0 3)} assume true; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:52,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {8681#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:52,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {8681#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:52,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {8682#(<= main_~a~0 4)} assume true; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:52,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {8682#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:52,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {8682#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:52,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {8683#(<= main_~a~0 5)} assume true; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:52,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {8683#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:52,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {8683#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:52,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {8684#(<= main_~a~0 6)} assume true; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:52,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {8684#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:52,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {8684#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:52,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {8685#(<= main_~a~0 7)} assume true; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:52,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {8685#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:52,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {8685#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:52,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {8686#(<= main_~a~0 8)} assume true; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:52,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {8686#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:52,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {8686#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:52,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {8687#(<= main_~a~0 9)} assume true; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:52,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {8687#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:52,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {8687#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:52,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {8688#(<= main_~a~0 10)} assume true; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:52,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {8688#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:52,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {8688#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8689#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:52,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {8689#(<= main_~a~0 11)} assume true; {8689#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:52,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {8689#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {8677#false} havoc ~i~0;~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 44: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,843 INFO L273 TraceCheckUtils]: 51: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 52: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 53: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 55: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 56: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 57: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 58: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 59: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:52,844 INFO L273 TraceCheckUtils]: 60: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 61: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 62: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 63: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 64: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 65: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 66: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 67: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 68: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 70: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 71: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 72: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 73: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 74: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 75: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 76: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,846 INFO L273 TraceCheckUtils]: 77: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 78: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 79: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 80: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 83: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 84: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 85: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,847 INFO L273 TraceCheckUtils]: 86: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 87: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 88: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 89: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 90: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 91: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 92: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 93: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 94: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 96: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 97: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 98: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 99: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 100: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 101: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 102: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,849 INFO L273 TraceCheckUtils]: 103: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 104: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 105: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 106: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 107: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 108: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 109: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 110: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 111: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,850 INFO L273 TraceCheckUtils]: 112: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 113: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 114: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 115: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 116: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 117: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 118: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 119: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,851 INFO L273 TraceCheckUtils]: 120: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 121: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 122: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 123: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 124: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 125: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 126: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 127: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 128: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,852 INFO L273 TraceCheckUtils]: 129: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 130: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 131: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 132: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 133: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 134: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 135: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 136: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 137: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,853 INFO L273 TraceCheckUtils]: 138: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 139: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 140: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 141: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 142: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 143: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 144: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 145: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:52,854 INFO L273 TraceCheckUtils]: 146: Hoare triple {8677#false} havoc ~x~0;~x~0 := 0; {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L273 TraceCheckUtils]: 147: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L273 TraceCheckUtils]: 148: Hoare triple {8677#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L256 TraceCheckUtils]: 149: Hoare triple {8677#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L273 TraceCheckUtils]: 150: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L273 TraceCheckUtils]: 151: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2018-11-18 22:43:52,855 INFO L273 TraceCheckUtils]: 152: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2018-11-18 22:43:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-11-18 22:43:52,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:52,875 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:43:52,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:52,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:52,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:52,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:53,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2018-11-18 22:43:53,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {8676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8676#true} is VALID [2018-11-18 22:43:53,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2018-11-18 22:43:53,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #126#return; {8676#true} is VALID [2018-11-18 22:43:53,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret16 := main(); {8676#true} is VALID [2018-11-18 22:43:53,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {8676#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8708#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:53,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {8708#(<= main_~a~0 0)} assume true; {8708#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:53,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {8708#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8708#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:53,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {8708#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:53,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {8679#(<= main_~a~0 1)} assume true; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:53,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {8679#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8679#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:53,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {8679#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:53,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {8680#(<= main_~a~0 2)} assume true; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:53,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {8680#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8680#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:53,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {8680#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:53,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {8681#(<= main_~a~0 3)} assume true; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:53,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {8681#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8681#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:53,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {8681#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:53,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {8682#(<= main_~a~0 4)} assume true; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:53,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {8682#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8682#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:53,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {8682#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:53,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {8683#(<= main_~a~0 5)} assume true; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:53,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {8683#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8683#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:53,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {8683#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:53,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {8684#(<= main_~a~0 6)} assume true; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:53,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {8684#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8684#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:53,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {8684#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:53,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {8685#(<= main_~a~0 7)} assume true; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:53,284 INFO L273 TraceCheckUtils]: 28: Hoare triple {8685#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8685#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:53,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {8685#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:53,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {8686#(<= main_~a~0 8)} assume true; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:53,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {8686#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8686#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:53,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {8686#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:53,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {8687#(<= main_~a~0 9)} assume true; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:53,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {8687#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8687#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:53,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {8687#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:53,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {8688#(<= main_~a~0 10)} assume true; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:53,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {8688#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8688#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:53,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {8688#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8689#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:53,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {8689#(<= main_~a~0 11)} assume true; {8689#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:53,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {8689#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {8677#false} havoc ~i~0;~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 56: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 57: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 58: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 59: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 60: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,297 INFO L273 TraceCheckUtils]: 61: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 62: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 63: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 64: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 65: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 66: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 71: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 72: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,299 INFO L273 TraceCheckUtils]: 75: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 76: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 77: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 78: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 79: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 80: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#false} is VALID [2018-11-18 22:43:53,300 INFO L273 TraceCheckUtils]: 81: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 82: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 83: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 84: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 86: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 87: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,301 INFO L273 TraceCheckUtils]: 88: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 89: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 90: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 91: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 92: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 93: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 94: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,302 INFO L273 TraceCheckUtils]: 95: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 96: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 97: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 98: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 99: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 100: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 101: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8677#false} is VALID [2018-11-18 22:43:53,303 INFO L273 TraceCheckUtils]: 102: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 103: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 104: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 105: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 106: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 107: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 108: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,304 INFO L273 TraceCheckUtils]: 109: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 110: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 111: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 112: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 113: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 114: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,305 INFO L273 TraceCheckUtils]: 115: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 116: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 117: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 118: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 119: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 120: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 121: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-18 22:43:53,306 INFO L273 TraceCheckUtils]: 122: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 123: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 124: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 125: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 126: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 127: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 128: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,307 INFO L273 TraceCheckUtils]: 129: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 130: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 131: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 132: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 133: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 134: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 135: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,308 INFO L273 TraceCheckUtils]: 136: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 137: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 138: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 139: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 140: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 141: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,309 INFO L273 TraceCheckUtils]: 142: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 143: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 144: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 145: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 146: Hoare triple {8677#false} havoc ~x~0;~x~0 := 0; {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 147: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L273 TraceCheckUtils]: 148: Hoare triple {8677#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {8677#false} is VALID [2018-11-18 22:43:53,310 INFO L256 TraceCheckUtils]: 149: Hoare triple {8677#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {8677#false} is VALID [2018-11-18 22:43:53,311 INFO L273 TraceCheckUtils]: 150: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2018-11-18 22:43:53,311 INFO L273 TraceCheckUtils]: 151: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2018-11-18 22:43:53,311 INFO L273 TraceCheckUtils]: 152: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2018-11-18 22:43:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-11-18 22:43:53,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:53,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:43:53,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-11-18 22:43:53,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:53,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:43:53,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:53,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:43:53,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:43:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:53,442 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 15 states. [2018-11-18 22:43:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:54,857 INFO L93 Difference]: Finished difference Result 279 states and 291 transitions. [2018-11-18 22:43:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:43:54,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-11-18 22:43:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2018-11-18 22:43:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2018-11-18 22:43:54,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 121 transitions. [2018-11-18 22:43:55,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:55,377 INFO L225 Difference]: With dead ends: 279 [2018-11-18 22:43:55,377 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 22:43:55,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 22:43:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-18 22:43:55,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:55,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-18 22:43:55,512 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-18 22:43:55,513 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-18 22:43:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:55,517 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-18 22:43:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-18 22:43:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:55,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:55,518 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-18 22:43:55,518 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-18 22:43:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:55,521 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-18 22:43:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-18 22:43:55,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:55,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:55,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:55,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 22:43:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 167 transitions. [2018-11-18 22:43:55,526 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 167 transitions. Word has length 153 [2018-11-18 22:43:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:55,526 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 167 transitions. [2018-11-18 22:43:55,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:43:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 167 transitions. [2018-11-18 22:43:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 22:43:55,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:55,529 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:55,529 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:55,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1870649556, now seen corresponding path program 11 times [2018-11-18 22:43:55,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:55,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:55,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:55,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:56,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {10061#true} call ULTIMATE.init(); {10061#true} is VALID [2018-11-18 22:43:56,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {10061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10061#true} is VALID [2018-11-18 22:43:56,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:43:56,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10061#true} {10061#true} #126#return; {10061#true} is VALID [2018-11-18 22:43:56,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {10061#true} call #t~ret16 := main(); {10061#true} is VALID [2018-11-18 22:43:56,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {10061#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10063#(= main_~a~0 0)} is VALID [2018-11-18 22:43:56,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {10063#(= main_~a~0 0)} assume true; {10063#(= main_~a~0 0)} is VALID [2018-11-18 22:43:56,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {10063#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10063#(= main_~a~0 0)} is VALID [2018-11-18 22:43:56,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {10063#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:56,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {10064#(<= main_~a~0 1)} assume true; {10064#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:56,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {10064#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10064#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:56,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {10064#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:56,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {10065#(<= main_~a~0 2)} assume true; {10065#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:56,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {10065#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10065#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:56,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {10065#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:56,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {10066#(<= main_~a~0 3)} assume true; {10066#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:56,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {10066#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10066#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:56,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {10066#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:56,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {10067#(<= main_~a~0 4)} assume true; {10067#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:56,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {10067#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10067#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:56,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {10067#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:56,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {10068#(<= main_~a~0 5)} assume true; {10068#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:56,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {10068#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10068#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:56,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {10068#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:56,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {10069#(<= main_~a~0 6)} assume true; {10069#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:56,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {10069#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10069#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:56,281 INFO L273 TraceCheckUtils]: 26: Hoare triple {10069#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:56,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {10070#(<= main_~a~0 7)} assume true; {10070#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:56,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {10070#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10070#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:56,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {10070#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10071#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:56,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {10071#(<= main_~a~0 8)} assume true; {10071#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:56,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {10071#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10071#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:56,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {10071#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10072#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:56,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {10072#(<= main_~a~0 9)} assume true; {10072#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:56,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {10072#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10072#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:56,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {10072#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10073#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:56,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {10073#(<= main_~a~0 10)} assume true; {10073#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:56,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {10073#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10073#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:56,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {10073#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10074#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:56,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {10074#(<= main_~a~0 11)} assume true; {10074#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:56,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {10074#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10074#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:56,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {10074#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10075#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:56,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {10075#(<= main_~a~0 12)} assume true; {10075#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {10075#(<= main_~a~0 12)} assume !(~a~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {10062#false} havoc ~i~0;~i~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 48: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 49: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 50: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 51: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 52: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 53: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 54: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 55: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 56: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 57: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 58: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 59: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 60: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 63: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 71: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 72: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 73: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 74: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 75: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 76: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 79: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 80: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 81: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 82: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 83: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 84: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 85: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 86: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 87: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 88: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 89: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 90: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 91: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 92: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 93: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 95: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 96: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 97: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 98: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 99: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 100: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 101: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 102: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 103: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 104: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 105: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 106: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 107: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 108: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 109: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 110: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 111: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 112: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 113: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 114: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 115: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 116: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 117: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 118: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 119: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 120: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 121: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 122: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 123: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 124: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 125: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 126: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 127: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 128: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 129: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 130: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 131: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 132: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 133: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 134: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 135: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 136: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 137: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 138: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 139: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 140: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 141: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 142: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 143: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 144: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 145: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 146: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 147: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 148: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 149: Hoare triple {10062#false} havoc ~x~0;~x~0 := 0; {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 150: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 151: Hoare triple {10062#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L256 TraceCheckUtils]: 152: Hoare triple {10062#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 153: Hoare triple {10062#false} ~cond := #in~cond; {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 154: Hoare triple {10062#false} assume 0 == ~cond; {10062#false} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 155: Hoare triple {10062#false} assume !false; {10062#false} is VALID [2018-11-18 22:43:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-11-18 22:43:56,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:56,321 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:43:56,339 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:44:57,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-18 22:44:57,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:57,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:57,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {10061#true} call ULTIMATE.init(); {10061#true} is VALID [2018-11-18 22:44:57,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {10061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10061#true} is VALID [2018-11-18 22:44:57,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10061#true} {10061#true} #126#return; {10061#true} is VALID [2018-11-18 22:44:57,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {10061#true} call #t~ret16 := main(); {10061#true} is VALID [2018-11-18 22:44:57,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {10061#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10061#true} is VALID [2018-11-18 22:44:57,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 31: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 32: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 40: Hoare triple {10061#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {10061#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 42: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {10061#true} assume !(~a~0 < 100000); {10061#true} is VALID [2018-11-18 22:44:57,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#true} havoc ~i~0;~i~0 := 0; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 46: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 47: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 48: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 49: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 50: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 51: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 53: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 54: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 55: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 56: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 57: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 58: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 59: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 60: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 62: Hoare triple {10061#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 63: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 64: Hoare triple {10061#true} assume !(~i~0 < 100000); {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 65: Hoare triple {10061#true} ~i~0 := 0; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 66: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 67: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 68: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 69: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,949 INFO L273 TraceCheckUtils]: 70: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 71: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 72: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 74: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 76: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 77: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,950 INFO L273 TraceCheckUtils]: 78: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 79: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 80: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 81: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 82: Hoare triple {10061#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 83: Hoare triple {10061#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 84: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-18 22:44:57,951 INFO L273 TraceCheckUtils]: 85: Hoare triple {10061#true} assume !(~i~0 < 100000); {10061#true} is VALID [2018-11-18 22:44:57,952 INFO L273 TraceCheckUtils]: 86: Hoare triple {10061#true} ~i~0 := 0; {10337#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:57,952 INFO L273 TraceCheckUtils]: 87: Hoare triple {10337#(<= main_~i~0 0)} assume true; {10337#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:57,952 INFO L273 TraceCheckUtils]: 88: Hoare triple {10337#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10337#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:57,953 INFO L273 TraceCheckUtils]: 89: Hoare triple {10337#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10347#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:57,953 INFO L273 TraceCheckUtils]: 90: Hoare triple {10347#(<= main_~i~0 1)} assume true; {10347#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:57,953 INFO L273 TraceCheckUtils]: 91: Hoare triple {10347#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10347#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:57,954 INFO L273 TraceCheckUtils]: 92: Hoare triple {10347#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10357#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:57,954 INFO L273 TraceCheckUtils]: 93: Hoare triple {10357#(<= main_~i~0 2)} assume true; {10357#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:57,954 INFO L273 TraceCheckUtils]: 94: Hoare triple {10357#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10357#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:57,955 INFO L273 TraceCheckUtils]: 95: Hoare triple {10357#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10367#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:57,955 INFO L273 TraceCheckUtils]: 96: Hoare triple {10367#(<= main_~i~0 3)} assume true; {10367#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:57,956 INFO L273 TraceCheckUtils]: 97: Hoare triple {10367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10367#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:57,957 INFO L273 TraceCheckUtils]: 98: Hoare triple {10367#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10377#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:57,957 INFO L273 TraceCheckUtils]: 99: Hoare triple {10377#(<= main_~i~0 4)} assume true; {10377#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:57,958 INFO L273 TraceCheckUtils]: 100: Hoare triple {10377#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10377#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:57,958 INFO L273 TraceCheckUtils]: 101: Hoare triple {10377#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10387#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:57,959 INFO L273 TraceCheckUtils]: 102: Hoare triple {10387#(<= main_~i~0 5)} assume true; {10387#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:57,959 INFO L273 TraceCheckUtils]: 103: Hoare triple {10387#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10387#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:57,960 INFO L273 TraceCheckUtils]: 104: Hoare triple {10387#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10397#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:57,961 INFO L273 TraceCheckUtils]: 105: Hoare triple {10397#(<= main_~i~0 6)} assume true; {10397#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:57,961 INFO L273 TraceCheckUtils]: 106: Hoare triple {10397#(<= main_~i~0 6)} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:44:57,962 INFO L273 TraceCheckUtils]: 107: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:44:57,962 INFO L273 TraceCheckUtils]: 108: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,962 INFO L273 TraceCheckUtils]: 109: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,962 INFO L273 TraceCheckUtils]: 110: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,962 INFO L273 TraceCheckUtils]: 111: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,963 INFO L273 TraceCheckUtils]: 113: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,963 INFO L273 TraceCheckUtils]: 114: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,963 INFO L273 TraceCheckUtils]: 115: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,963 INFO L273 TraceCheckUtils]: 116: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,964 INFO L273 TraceCheckUtils]: 117: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,964 INFO L273 TraceCheckUtils]: 118: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,964 INFO L273 TraceCheckUtils]: 119: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,964 INFO L273 TraceCheckUtils]: 120: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,964 INFO L273 TraceCheckUtils]: 121: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 122: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 123: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 124: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 125: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 126: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 127: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:44:57,965 INFO L273 TraceCheckUtils]: 128: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 129: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 130: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 131: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 132: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 133: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 134: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 135: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 136: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,966 INFO L273 TraceCheckUtils]: 137: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 138: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 139: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 140: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 141: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 142: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 143: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 144: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 145: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-18 22:44:57,967 INFO L273 TraceCheckUtils]: 146: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 147: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 148: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 149: Hoare triple {10062#false} havoc ~x~0;~x~0 := 0; {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 150: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 151: Hoare triple {10062#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L256 TraceCheckUtils]: 152: Hoare triple {10062#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 153: Hoare triple {10062#false} ~cond := #in~cond; {10062#false} is VALID [2018-11-18 22:44:57,968 INFO L273 TraceCheckUtils]: 154: Hoare triple {10062#false} assume 0 == ~cond; {10062#false} is VALID [2018-11-18 22:44:57,969 INFO L273 TraceCheckUtils]: 155: Hoare triple {10062#false} assume !false; {10062#false} is VALID [2018-11-18 22:44:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-18 22:44:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-18 22:44:58,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 156 [2018-11-18 22:44:58,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:58,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:44:58,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:58,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:44:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:44:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:44:58,111 INFO L87 Difference]: Start difference. First operand 161 states and 167 transitions. Second operand 22 states. [2018-11-18 22:44:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:59,501 INFO L93 Difference]: Finished difference Result 302 states and 319 transitions. [2018-11-18 22:44:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:44:59,502 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 156 [2018-11-18 22:44:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:44:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 234 transitions. [2018-11-18 22:44:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:44:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 234 transitions. [2018-11-18 22:44:59,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 234 transitions. [2018-11-18 22:45:00,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:00,317 INFO L225 Difference]: With dead ends: 302 [2018-11-18 22:45:00,317 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 22:45:00,318 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:45:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 22:45:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2018-11-18 22:45:00,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:00,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 179 states. [2018-11-18 22:45:00,407 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 179 states. [2018-11-18 22:45:00,407 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 179 states. [2018-11-18 22:45:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:00,412 INFO L93 Difference]: Finished difference Result 185 states and 191 transitions. [2018-11-18 22:45:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2018-11-18 22:45:00,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:00,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:00,413 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 185 states. [2018-11-18 22:45:00,413 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 185 states. [2018-11-18 22:45:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:00,416 INFO L93 Difference]: Finished difference Result 185 states and 191 transitions. [2018-11-18 22:45:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2018-11-18 22:45:00,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:00,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:00,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:00,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 22:45:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 185 transitions. [2018-11-18 22:45:00,421 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 185 transitions. Word has length 156 [2018-11-18 22:45:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:00,421 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 185 transitions. [2018-11-18 22:45:00,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:45:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 185 transitions. [2018-11-18 22:45:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-18 22:45:00,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:00,423 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:00,424 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:00,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash 316085635, now seen corresponding path program 12 times [2018-11-18 22:45:00,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:00,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:00,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:00,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:00,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:01,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {11561#true} call ULTIMATE.init(); {11561#true} is VALID [2018-11-18 22:45:01,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {11561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11561#true} is VALID [2018-11-18 22:45:01,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {11561#true} assume true; {11561#true} is VALID [2018-11-18 22:45:01,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11561#true} {11561#true} #126#return; {11561#true} is VALID [2018-11-18 22:45:01,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {11561#true} call #t~ret16 := main(); {11561#true} is VALID [2018-11-18 22:45:01,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {11561#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11563#(= main_~a~0 0)} is VALID [2018-11-18 22:45:01,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {11563#(= main_~a~0 0)} assume true; {11563#(= main_~a~0 0)} is VALID [2018-11-18 22:45:01,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {11563#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11563#(= main_~a~0 0)} is VALID [2018-11-18 22:45:01,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {11563#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:01,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {11564#(<= main_~a~0 1)} assume true; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:01,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {11564#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:01,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {11564#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:01,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {11565#(<= main_~a~0 2)} assume true; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:01,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {11565#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:01,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {11565#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:01,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {11566#(<= main_~a~0 3)} assume true; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:01,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {11566#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:01,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {11566#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:01,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {11567#(<= main_~a~0 4)} assume true; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:01,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {11567#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:01,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {11567#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:01,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {11568#(<= main_~a~0 5)} assume true; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:01,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {11568#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:01,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {11568#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:01,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {11569#(<= main_~a~0 6)} assume true; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:01,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {11569#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:01,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {11569#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:01,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {11570#(<= main_~a~0 7)} assume true; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:01,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {11570#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:01,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {11570#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:01,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {11571#(<= main_~a~0 8)} assume true; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:01,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {11571#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:01,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {11571#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:01,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {11572#(<= main_~a~0 9)} assume true; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:01,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {11572#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:01,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {11572#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:01,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {11573#(<= main_~a~0 10)} assume true; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:01,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {11573#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:01,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {11573#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:01,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {11574#(<= main_~a~0 11)} assume true; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:01,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {11574#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:01,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {11574#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:01,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {11575#(<= main_~a~0 12)} assume true; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:01,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {11575#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:01,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {11575#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11576#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:01,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {11576#(<= main_~a~0 13)} assume true; {11576#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:01,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {11576#(<= main_~a~0 13)} assume !(~a~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {11562#false} havoc ~i~0;~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,418 INFO L273 TraceCheckUtils]: 61: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:01,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:01,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 71: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 72: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 77: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 79: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 80: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 82: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 83: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 84: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 85: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,421 INFO L273 TraceCheckUtils]: 87: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 88: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 93: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 94: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,422 INFO L273 TraceCheckUtils]: 95: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 96: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 97: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 98: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 101: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 102: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 103: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,423 INFO L273 TraceCheckUtils]: 104: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 105: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 106: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 107: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 108: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 109: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 110: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 111: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 112: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 114: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 115: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 116: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 117: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 118: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 119: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 120: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 121: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,425 INFO L273 TraceCheckUtils]: 122: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 123: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 124: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 125: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 126: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 127: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 128: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 129: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 130: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,426 INFO L273 TraceCheckUtils]: 131: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 132: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 133: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 134: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 135: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 136: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 137: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 138: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 139: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:01,427 INFO L273 TraceCheckUtils]: 140: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 141: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 142: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 143: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 144: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 145: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 146: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 147: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,428 INFO L273 TraceCheckUtils]: 148: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 149: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 150: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 151: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 152: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 153: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 154: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 155: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 156: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,429 INFO L273 TraceCheckUtils]: 157: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 158: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 159: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 160: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 161: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 162: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 163: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 164: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 165: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,430 INFO L273 TraceCheckUtils]: 166: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 167: Hoare triple {11562#false} havoc ~x~0;~x~0 := 0; {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 168: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 169: Hoare triple {11562#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L256 TraceCheckUtils]: 170: Hoare triple {11562#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 171: Hoare triple {11562#false} ~cond := #in~cond; {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 172: Hoare triple {11562#false} assume 0 == ~cond; {11562#false} is VALID [2018-11-18 22:45:01,431 INFO L273 TraceCheckUtils]: 173: Hoare triple {11562#false} assume !false; {11562#false} is VALID [2018-11-18 22:45:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:01,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:01,444 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:45:01,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:45:36,532 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-18 22:45:36,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:36,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:36,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {11561#true} call ULTIMATE.init(); {11561#true} is VALID [2018-11-18 22:45:36,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {11561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11561#true} is VALID [2018-11-18 22:45:36,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {11561#true} assume true; {11561#true} is VALID [2018-11-18 22:45:36,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11561#true} {11561#true} #126#return; {11561#true} is VALID [2018-11-18 22:45:36,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {11561#true} call #t~ret16 := main(); {11561#true} is VALID [2018-11-18 22:45:36,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {11561#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11595#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:36,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {11595#(<= main_~a~0 0)} assume true; {11595#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:36,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {11595#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11595#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:36,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {11595#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:36,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {11564#(<= main_~a~0 1)} assume true; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:36,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {11564#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11564#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:36,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {11564#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:36,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {11565#(<= main_~a~0 2)} assume true; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:36,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {11565#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11565#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:36,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {11565#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:36,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {11566#(<= main_~a~0 3)} assume true; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:36,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {11566#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11566#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:36,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {11566#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:36,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {11567#(<= main_~a~0 4)} assume true; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:36,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {11567#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11567#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:36,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {11567#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:36,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {11568#(<= main_~a~0 5)} assume true; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:36,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {11568#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11568#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:36,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {11568#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:36,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {11569#(<= main_~a~0 6)} assume true; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:36,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {11569#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11569#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:36,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {11569#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:36,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {11570#(<= main_~a~0 7)} assume true; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:36,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {11570#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11570#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:36,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {11570#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:36,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {11571#(<= main_~a~0 8)} assume true; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:36,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {11571#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11571#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:36,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {11571#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:36,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {11572#(<= main_~a~0 9)} assume true; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:36,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {11572#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11572#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:36,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {11572#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:36,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {11573#(<= main_~a~0 10)} assume true; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:36,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {11573#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11573#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:36,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {11573#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:36,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {11574#(<= main_~a~0 11)} assume true; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:36,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {11574#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11574#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:36,967 INFO L273 TraceCheckUtils]: 41: Hoare triple {11574#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:36,967 INFO L273 TraceCheckUtils]: 42: Hoare triple {11575#(<= main_~a~0 12)} assume true; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:36,968 INFO L273 TraceCheckUtils]: 43: Hoare triple {11575#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11575#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:36,968 INFO L273 TraceCheckUtils]: 44: Hoare triple {11575#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11576#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:36,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {11576#(<= main_~a~0 13)} assume true; {11576#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:36,970 INFO L273 TraceCheckUtils]: 46: Hoare triple {11576#(<= main_~a~0 13)} assume !(~a~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,970 INFO L273 TraceCheckUtils]: 47: Hoare triple {11562#false} havoc ~i~0;~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,970 INFO L273 TraceCheckUtils]: 48: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,970 INFO L273 TraceCheckUtils]: 49: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,971 INFO L273 TraceCheckUtils]: 50: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,971 INFO L273 TraceCheckUtils]: 51: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,971 INFO L273 TraceCheckUtils]: 52: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,971 INFO L273 TraceCheckUtils]: 53: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,973 INFO L273 TraceCheckUtils]: 63: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11562#false} is VALID [2018-11-18 22:45:36,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {11562#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11562#false} is VALID [2018-11-18 22:45:36,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,974 INFO L273 TraceCheckUtils]: 70: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 75: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 76: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,975 INFO L273 TraceCheckUtils]: 77: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 78: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 80: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 81: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 82: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 83: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 84: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 85: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,976 INFO L273 TraceCheckUtils]: 86: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 87: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 88: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 89: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 90: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 91: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 92: Hoare triple {11562#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 93: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 94: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,977 INFO L273 TraceCheckUtils]: 95: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 96: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 97: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 98: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 99: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 100: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 101: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 102: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 103: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,978 INFO L273 TraceCheckUtils]: 104: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 105: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 106: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 108: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 109: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 110: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 111: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,979 INFO L273 TraceCheckUtils]: 112: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 113: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 114: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 115: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 116: Hoare triple {11562#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 117: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 118: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 119: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 120: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,980 INFO L273 TraceCheckUtils]: 121: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 122: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 123: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 124: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 125: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 126: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 127: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 128: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 129: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,981 INFO L273 TraceCheckUtils]: 130: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 131: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 132: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 133: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 134: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 135: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 136: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 137: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 138: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,982 INFO L273 TraceCheckUtils]: 139: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 140: Hoare triple {11562#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 141: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 142: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 143: Hoare triple {11562#false} ~i~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 144: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 145: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 146: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,983 INFO L273 TraceCheckUtils]: 147: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 148: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 149: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 150: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 151: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 152: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 153: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 154: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 155: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,984 INFO L273 TraceCheckUtils]: 156: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 157: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 158: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 159: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 160: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 161: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 162: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 163: Hoare triple {11562#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 164: Hoare triple {11562#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {11562#false} is VALID [2018-11-18 22:45:36,985 INFO L273 TraceCheckUtils]: 165: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 166: Hoare triple {11562#false} assume !(~i~0 < 100000); {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 167: Hoare triple {11562#false} havoc ~x~0;~x~0 := 0; {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 168: Hoare triple {11562#false} assume true; {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 169: Hoare triple {11562#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L256 TraceCheckUtils]: 170: Hoare triple {11562#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 171: Hoare triple {11562#false} ~cond := #in~cond; {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 172: Hoare triple {11562#false} assume 0 == ~cond; {11562#false} is VALID [2018-11-18 22:45:36,986 INFO L273 TraceCheckUtils]: 173: Hoare triple {11562#false} assume !false; {11562#false} is VALID [2018-11-18 22:45:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:37,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:37,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:45:37,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-11-18 22:45:37,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:37,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:45:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:45:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:45:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:45:37,111 INFO L87 Difference]: Start difference. First operand 179 states and 185 transitions. Second operand 17 states. [2018-11-18 22:45:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:38,127 INFO L93 Difference]: Finished difference Result 315 states and 327 transitions. [2018-11-18 22:45:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:45:38,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-11-18 22:45:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:45:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-18 22:45:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:45:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-18 22:45:38,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2018-11-18 22:45:38,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:38,271 INFO L225 Difference]: With dead ends: 315 [2018-11-18 22:45:38,271 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 22:45:38,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:45:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 22:45:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-18 22:45:38,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:38,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 182 states. [2018-11-18 22:45:38,364 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 182 states. [2018-11-18 22:45:38,364 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 182 states. [2018-11-18 22:45:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:38,369 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-11-18 22:45:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 189 transitions. [2018-11-18 22:45:38,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:38,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:38,369 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 183 states. [2018-11-18 22:45:38,370 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 183 states. [2018-11-18 22:45:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:38,373 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-11-18 22:45:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 189 transitions. [2018-11-18 22:45:38,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:38,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:38,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:38,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 22:45:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 188 transitions. [2018-11-18 22:45:38,378 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 188 transitions. Word has length 174 [2018-11-18 22:45:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:38,378 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 188 transitions. [2018-11-18 22:45:38,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:45:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 188 transitions. [2018-11-18 22:45:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 22:45:38,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:38,380 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:38,380 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:38,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1001232224, now seen corresponding path program 13 times [2018-11-18 22:45:38,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:38,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:38,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {13129#true} call ULTIMATE.init(); {13129#true} is VALID [2018-11-18 22:45:38,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {13129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13129#true} is VALID [2018-11-18 22:45:38,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {13129#true} assume true; {13129#true} is VALID [2018-11-18 22:45:38,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13129#true} {13129#true} #126#return; {13129#true} is VALID [2018-11-18 22:45:38,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {13129#true} call #t~ret16 := main(); {13129#true} is VALID [2018-11-18 22:45:38,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {13129#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13131#(= main_~a~0 0)} is VALID [2018-11-18 22:45:38,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {13131#(= main_~a~0 0)} assume true; {13131#(= main_~a~0 0)} is VALID [2018-11-18 22:45:38,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {13131#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13131#(= main_~a~0 0)} is VALID [2018-11-18 22:45:38,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {13131#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:38,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {13132#(<= main_~a~0 1)} assume true; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:38,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {13132#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:38,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {13132#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:38,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {13133#(<= main_~a~0 2)} assume true; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:38,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {13133#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:38,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {13133#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:38,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {13134#(<= main_~a~0 3)} assume true; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:38,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {13134#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:38,940 INFO L273 TraceCheckUtils]: 17: Hoare triple {13134#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:38,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {13135#(<= main_~a~0 4)} assume true; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:38,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {13135#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:38,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {13135#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:38,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {13136#(<= main_~a~0 5)} assume true; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:38,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {13136#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:38,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {13136#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:38,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {13137#(<= main_~a~0 6)} assume true; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:38,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {13137#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:38,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {13137#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:38,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {13138#(<= main_~a~0 7)} assume true; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:38,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {13138#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:38,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {13138#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:38,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {13139#(<= main_~a~0 8)} assume true; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:38,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {13139#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:38,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {13139#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:38,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {13140#(<= main_~a~0 9)} assume true; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:38,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {13140#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:38,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {13140#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:38,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {13141#(<= main_~a~0 10)} assume true; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:38,956 INFO L273 TraceCheckUtils]: 37: Hoare triple {13141#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:38,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {13141#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:38,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {13142#(<= main_~a~0 11)} assume true; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:38,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {13142#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:38,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {13142#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:38,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {13143#(<= main_~a~0 12)} assume true; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:38,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {13143#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:38,960 INFO L273 TraceCheckUtils]: 44: Hoare triple {13143#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:38,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {13144#(<= main_~a~0 13)} assume true; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:38,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {13144#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:38,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {13144#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13145#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:38,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {13145#(<= main_~a~0 14)} assume true; {13145#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {13145#(<= main_~a~0 14)} assume !(~a~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {13130#false} havoc ~i~0;~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,967 INFO L273 TraceCheckUtils]: 61: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 65: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 67: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 70: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 71: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 72: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 73: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 74: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 75: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 76: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,969 INFO L273 TraceCheckUtils]: 77: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 79: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 80: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 81: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 82: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 83: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 84: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 85: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,970 INFO L273 TraceCheckUtils]: 86: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 88: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 89: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 90: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 91: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 92: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 93: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,971 INFO L273 TraceCheckUtils]: 94: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 98: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 99: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,972 INFO L273 TraceCheckUtils]: 100: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 102: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 105: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,973 INFO L273 TraceCheckUtils]: 106: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,974 INFO L273 TraceCheckUtils]: 107: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,974 INFO L273 TraceCheckUtils]: 108: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,974 INFO L273 TraceCheckUtils]: 109: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,974 INFO L273 TraceCheckUtils]: 110: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,974 INFO L273 TraceCheckUtils]: 111: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 112: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 113: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 114: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 115: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 116: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,975 INFO L273 TraceCheckUtils]: 117: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 118: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 119: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 120: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 121: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 122: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,976 INFO L273 TraceCheckUtils]: 123: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 124: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 125: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 126: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 127: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 128: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,977 INFO L273 TraceCheckUtils]: 129: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 130: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 131: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 132: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 133: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 134: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,978 INFO L273 TraceCheckUtils]: 135: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 136: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 137: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 138: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 139: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 140: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,979 INFO L273 TraceCheckUtils]: 141: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 142: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 143: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 144: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 145: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 146: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,980 INFO L273 TraceCheckUtils]: 147: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 148: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 149: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 150: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 151: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 152: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,981 INFO L273 TraceCheckUtils]: 153: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 154: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 155: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 156: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 157: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 158: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,982 INFO L273 TraceCheckUtils]: 159: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 160: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 161: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 162: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 163: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 164: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 165: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,983 INFO L273 TraceCheckUtils]: 166: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 167: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 168: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 169: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 170: Hoare triple {13130#false} havoc ~x~0;~x~0 := 0; {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 171: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:38,984 INFO L273 TraceCheckUtils]: 172: Hoare triple {13130#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13130#false} is VALID [2018-11-18 22:45:38,985 INFO L256 TraceCheckUtils]: 173: Hoare triple {13130#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {13130#false} is VALID [2018-11-18 22:45:38,985 INFO L273 TraceCheckUtils]: 174: Hoare triple {13130#false} ~cond := #in~cond; {13130#false} is VALID [2018-11-18 22:45:38,985 INFO L273 TraceCheckUtils]: 175: Hoare triple {13130#false} assume 0 == ~cond; {13130#false} is VALID [2018-11-18 22:45:38,985 INFO L273 TraceCheckUtils]: 176: Hoare triple {13130#false} assume !false; {13130#false} is VALID [2018-11-18 22:45:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:39,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:39,002 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:45:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:39,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:39,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {13129#true} call ULTIMATE.init(); {13129#true} is VALID [2018-11-18 22:45:39,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {13129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13129#true} is VALID [2018-11-18 22:45:39,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {13129#true} assume true; {13129#true} is VALID [2018-11-18 22:45:39,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13129#true} {13129#true} #126#return; {13129#true} is VALID [2018-11-18 22:45:39,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {13129#true} call #t~ret16 := main(); {13129#true} is VALID [2018-11-18 22:45:39,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {13129#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13164#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:39,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {13164#(<= main_~a~0 0)} assume true; {13164#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:39,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {13164#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13164#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:39,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {13164#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:39,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {13132#(<= main_~a~0 1)} assume true; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:39,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {13132#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13132#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:39,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {13132#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:39,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {13133#(<= main_~a~0 2)} assume true; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:39,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {13133#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13133#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:39,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {13133#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:39,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {13134#(<= main_~a~0 3)} assume true; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:39,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {13134#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13134#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:39,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {13134#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:39,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {13135#(<= main_~a~0 4)} assume true; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:39,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {13135#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13135#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:39,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {13135#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:39,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {13136#(<= main_~a~0 5)} assume true; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:39,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {13136#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13136#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:39,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {13136#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:39,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {13137#(<= main_~a~0 6)} assume true; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:39,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {13137#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13137#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:39,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {13137#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:39,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {13138#(<= main_~a~0 7)} assume true; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:39,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {13138#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13138#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:39,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {13138#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:39,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {13139#(<= main_~a~0 8)} assume true; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:39,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {13139#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13139#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:39,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {13139#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:39,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {13140#(<= main_~a~0 9)} assume true; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:39,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {13140#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13140#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:39,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {13140#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:39,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {13141#(<= main_~a~0 10)} assume true; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:39,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {13141#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13141#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:39,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {13141#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:39,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {13142#(<= main_~a~0 11)} assume true; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:39,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {13142#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13142#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:39,567 INFO L273 TraceCheckUtils]: 41: Hoare triple {13142#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:39,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {13143#(<= main_~a~0 12)} assume true; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:39,570 INFO L273 TraceCheckUtils]: 43: Hoare triple {13143#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13143#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:39,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {13143#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:39,573 INFO L273 TraceCheckUtils]: 45: Hoare triple {13144#(<= main_~a~0 13)} assume true; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:39,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {13144#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13144#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:39,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {13144#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13145#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:39,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {13145#(<= main_~a~0 14)} assume true; {13145#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:39,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {13145#(<= main_~a~0 14)} assume !(~a~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {13130#false} havoc ~i~0;~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 54: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 55: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 56: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 57: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 59: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 61: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 63: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 64: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 68: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,580 INFO L273 TraceCheckUtils]: 69: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {13130#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 74: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 75: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 81: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 82: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 83: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 84: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,582 INFO L273 TraceCheckUtils]: 87: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 89: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 91: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 92: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 93: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 94: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 95: Hoare triple {13130#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13130#false} is VALID [2018-11-18 22:45:39,583 INFO L273 TraceCheckUtils]: 96: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 98: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 99: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 100: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 101: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 102: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 103: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 104: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,584 INFO L273 TraceCheckUtils]: 105: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 106: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 107: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 108: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 109: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 110: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 111: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 112: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 113: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,585 INFO L273 TraceCheckUtils]: 114: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 115: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 116: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 117: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 118: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 119: Hoare triple {13130#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 120: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 121: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,586 INFO L273 TraceCheckUtils]: 122: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 123: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 124: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 125: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 126: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 127: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 128: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 129: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 130: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,587 INFO L273 TraceCheckUtils]: 131: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 132: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 133: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 134: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 135: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 136: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 137: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 138: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 139: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,588 INFO L273 TraceCheckUtils]: 140: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 141: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 142: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 143: Hoare triple {13130#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 144: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 145: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 146: Hoare triple {13130#false} ~i~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 147: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 148: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,589 INFO L273 TraceCheckUtils]: 149: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 150: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 151: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 152: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 153: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 154: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 155: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 156: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 157: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,590 INFO L273 TraceCheckUtils]: 158: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 159: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 160: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 161: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 162: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 163: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 164: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 165: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 166: Hoare triple {13130#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13130#false} is VALID [2018-11-18 22:45:39,591 INFO L273 TraceCheckUtils]: 167: Hoare triple {13130#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 168: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 169: Hoare triple {13130#false} assume !(~i~0 < 100000); {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 170: Hoare triple {13130#false} havoc ~x~0;~x~0 := 0; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 171: Hoare triple {13130#false} assume true; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 172: Hoare triple {13130#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L256 TraceCheckUtils]: 173: Hoare triple {13130#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 174: Hoare triple {13130#false} ~cond := #in~cond; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 175: Hoare triple {13130#false} assume 0 == ~cond; {13130#false} is VALID [2018-11-18 22:45:39,592 INFO L273 TraceCheckUtils]: 176: Hoare triple {13130#false} assume !false; {13130#false} is VALID [2018-11-18 22:45:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:39,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:39,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:45:39,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-11-18 22:45:39,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:39,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:45:39,748 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:45:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:45:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:45:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:45:39,749 INFO L87 Difference]: Start difference. First operand 182 states and 188 transitions. Second operand 18 states. [2018-11-18 22:45:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:40,618 INFO L93 Difference]: Finished difference Result 318 states and 330 transitions. [2018-11-18 22:45:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:45:40,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-11-18 22:45:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:45:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 130 transitions. [2018-11-18 22:45:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:45:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 130 transitions. [2018-11-18 22:45:40,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 130 transitions. [2018-11-18 22:45:40,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:40,735 INFO L225 Difference]: With dead ends: 318 [2018-11-18 22:45:40,735 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 22:45:40,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:45:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 22:45:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-11-18 22:45:40,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:40,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 185 states. [2018-11-18 22:45:40,920 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 185 states. [2018-11-18 22:45:40,920 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 185 states. [2018-11-18 22:45:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:40,923 INFO L93 Difference]: Finished difference Result 186 states and 192 transitions. [2018-11-18 22:45:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 192 transitions. [2018-11-18 22:45:40,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:40,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:40,924 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 186 states. [2018-11-18 22:45:40,924 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 186 states. [2018-11-18 22:45:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:40,927 INFO L93 Difference]: Finished difference Result 186 states and 192 transitions. [2018-11-18 22:45:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 192 transitions. [2018-11-18 22:45:40,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:40,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:40,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:40,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 22:45:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 191 transitions. [2018-11-18 22:45:40,931 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 191 transitions. Word has length 177 [2018-11-18 22:45:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:40,931 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 191 transitions. [2018-11-18 22:45:40,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:45:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2018-11-18 22:45:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 22:45:40,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:40,932 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:40,933 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:40,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1776292765, now seen corresponding path program 14 times [2018-11-18 22:45:40,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:40,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:41,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {14721#true} call ULTIMATE.init(); {14721#true} is VALID [2018-11-18 22:45:41,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {14721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14721#true} is VALID [2018-11-18 22:45:41,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {14721#true} assume true; {14721#true} is VALID [2018-11-18 22:45:41,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14721#true} {14721#true} #126#return; {14721#true} is VALID [2018-11-18 22:45:41,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {14721#true} call #t~ret16 := main(); {14721#true} is VALID [2018-11-18 22:45:41,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {14721#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14723#(= main_~a~0 0)} is VALID [2018-11-18 22:45:41,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {14723#(= main_~a~0 0)} assume true; {14723#(= main_~a~0 0)} is VALID [2018-11-18 22:45:41,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {14723#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14723#(= main_~a~0 0)} is VALID [2018-11-18 22:45:41,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {14723#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {14724#(<= main_~a~0 1)} assume true; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {14724#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {14724#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {14725#(<= main_~a~0 2)} assume true; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {14725#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {14725#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {14726#(<= main_~a~0 3)} assume true; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {14726#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {14726#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {14727#(<= main_~a~0 4)} assume true; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {14727#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {14727#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {14728#(<= main_~a~0 5)} assume true; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {14728#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {14728#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {14729#(<= main_~a~0 6)} assume true; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {14729#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {14729#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {14730#(<= main_~a~0 7)} assume true; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {14730#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {14730#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {14731#(<= main_~a~0 8)} assume true; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {14731#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {14731#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {14732#(<= main_~a~0 9)} assume true; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,251 INFO L273 TraceCheckUtils]: 34: Hoare triple {14732#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {14732#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {14733#(<= main_~a~0 10)} assume true; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {14733#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {14733#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {14734#(<= main_~a~0 11)} assume true; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {14734#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {14734#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {14735#(<= main_~a~0 12)} assume true; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {14735#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {14735#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,257 INFO L273 TraceCheckUtils]: 45: Hoare triple {14736#(<= main_~a~0 13)} assume true; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {14736#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {14736#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {14737#(<= main_~a~0 14)} assume true; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {14737#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {14737#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14738#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:41,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {14738#(<= main_~a~0 15)} assume true; {14738#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:41,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {14738#(<= main_~a~0 15)} assume !(~a~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {14722#false} havoc ~i~0;~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 60: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 61: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 62: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 72: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 78: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 79: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 85: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 92: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,266 INFO L273 TraceCheckUtils]: 93: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 96: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 101: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,267 INFO L273 TraceCheckUtils]: 102: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 104: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 106: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 108: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 109: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 110: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,268 INFO L273 TraceCheckUtils]: 111: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 112: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 113: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 114: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 115: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 116: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 119: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,269 INFO L273 TraceCheckUtils]: 120: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 121: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 122: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 123: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 124: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 125: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 126: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 127: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 128: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,270 INFO L273 TraceCheckUtils]: 129: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 130: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 131: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 132: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 134: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 135: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 136: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 137: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,271 INFO L273 TraceCheckUtils]: 138: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 139: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 140: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 141: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 142: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 143: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 144: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 145: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 146: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,272 INFO L273 TraceCheckUtils]: 147: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 148: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 149: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 150: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 151: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 152: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 153: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 154: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 155: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,273 INFO L273 TraceCheckUtils]: 156: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 157: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 158: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 159: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 160: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 161: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 162: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 163: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 164: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,274 INFO L273 TraceCheckUtils]: 165: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 166: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 167: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 168: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 169: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 170: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 171: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 172: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,275 INFO L273 TraceCheckUtils]: 173: Hoare triple {14722#false} havoc ~x~0;~x~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L273 TraceCheckUtils]: 174: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L273 TraceCheckUtils]: 175: Hoare triple {14722#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L256 TraceCheckUtils]: 176: Hoare triple {14722#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L273 TraceCheckUtils]: 177: Hoare triple {14722#false} ~cond := #in~cond; {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L273 TraceCheckUtils]: 178: Hoare triple {14722#false} assume 0 == ~cond; {14722#false} is VALID [2018-11-18 22:45:41,276 INFO L273 TraceCheckUtils]: 179: Hoare triple {14722#false} assume !false; {14722#false} is VALID [2018-11-18 22:45:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:41,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:41,289 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:45:41,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:45:41,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:45:41,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:41,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:41,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {14721#true} call ULTIMATE.init(); {14721#true} is VALID [2018-11-18 22:45:41,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {14721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14721#true} is VALID [2018-11-18 22:45:41,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {14721#true} assume true; {14721#true} is VALID [2018-11-18 22:45:41,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14721#true} {14721#true} #126#return; {14721#true} is VALID [2018-11-18 22:45:41,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {14721#true} call #t~ret16 := main(); {14721#true} is VALID [2018-11-18 22:45:41,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {14721#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14757#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:41,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {14757#(<= main_~a~0 0)} assume true; {14757#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:41,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {14757#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14757#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:41,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {14757#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {14724#(<= main_~a~0 1)} assume true; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {14724#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14724#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:41,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {14724#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {14725#(<= main_~a~0 2)} assume true; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {14725#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14725#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:41,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {14725#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {14726#(<= main_~a~0 3)} assume true; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {14726#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14726#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:41,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {14726#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {14727#(<= main_~a~0 4)} assume true; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {14727#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14727#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:41,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {14727#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {14728#(<= main_~a~0 5)} assume true; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {14728#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14728#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:41,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {14728#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {14729#(<= main_~a~0 6)} assume true; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {14729#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14729#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:41,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {14729#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {14730#(<= main_~a~0 7)} assume true; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {14730#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14730#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:41,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {14730#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {14731#(<= main_~a~0 8)} assume true; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {14731#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14731#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:41,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {14731#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {14732#(<= main_~a~0 9)} assume true; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {14732#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14732#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:41,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {14732#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {14733#(<= main_~a~0 10)} assume true; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {14733#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14733#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:41,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {14733#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {14734#(<= main_~a~0 11)} assume true; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {14734#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14734#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:41,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {14734#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {14735#(<= main_~a~0 12)} assume true; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,640 INFO L273 TraceCheckUtils]: 43: Hoare triple {14735#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14735#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:41,641 INFO L273 TraceCheckUtils]: 44: Hoare triple {14735#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {14736#(<= main_~a~0 13)} assume true; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {14736#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14736#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:41,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {14736#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {14737#(<= main_~a~0 14)} assume true; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {14737#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14737#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:41,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {14737#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14738#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:41,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {14738#(<= main_~a~0 15)} assume true; {14738#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:41,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {14738#(<= main_~a~0 15)} assume !(~a~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {14722#false} havoc ~i~0;~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,645 INFO L273 TraceCheckUtils]: 54: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,646 INFO L273 TraceCheckUtils]: 56: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,646 INFO L273 TraceCheckUtils]: 57: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,646 INFO L273 TraceCheckUtils]: 58: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,646 INFO L273 TraceCheckUtils]: 59: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 60: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 62: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 63: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 64: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,647 INFO L273 TraceCheckUtils]: 65: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,648 INFO L273 TraceCheckUtils]: 66: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,648 INFO L273 TraceCheckUtils]: 67: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,648 INFO L273 TraceCheckUtils]: 69: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,648 INFO L273 TraceCheckUtils]: 70: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,649 INFO L273 TraceCheckUtils]: 73: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14722#false} is VALID [2018-11-18 22:45:41,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {14722#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14722#false} is VALID [2018-11-18 22:45:41,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 78: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 81: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 82: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,650 INFO L273 TraceCheckUtils]: 83: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 84: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 85: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 87: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 88: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 90: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 94: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 95: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 96: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 97: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 98: Hoare triple {14722#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 99: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,652 INFO L273 TraceCheckUtils]: 100: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 101: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 102: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 103: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 104: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 105: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,653 INFO L273 TraceCheckUtils]: 106: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 107: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 108: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 109: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 110: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 111: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,654 INFO L273 TraceCheckUtils]: 112: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,655 INFO L273 TraceCheckUtils]: 113: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,655 INFO L273 TraceCheckUtils]: 114: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,655 INFO L273 TraceCheckUtils]: 115: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,655 INFO L273 TraceCheckUtils]: 116: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,655 INFO L273 TraceCheckUtils]: 117: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 118: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 119: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 120: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 121: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 122: Hoare triple {14722#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14722#false} is VALID [2018-11-18 22:45:41,656 INFO L273 TraceCheckUtils]: 123: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 124: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 125: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 126: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 127: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 128: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,657 INFO L273 TraceCheckUtils]: 129: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 130: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 131: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 132: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 133: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 134: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,658 INFO L273 TraceCheckUtils]: 135: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 136: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 137: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 138: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 139: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 140: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,659 INFO L273 TraceCheckUtils]: 141: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,660 INFO L273 TraceCheckUtils]: 142: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,660 INFO L273 TraceCheckUtils]: 143: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,660 INFO L273 TraceCheckUtils]: 144: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,660 INFO L273 TraceCheckUtils]: 145: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14722#false} is VALID [2018-11-18 22:45:41,660 INFO L273 TraceCheckUtils]: 146: Hoare triple {14722#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 147: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 148: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 149: Hoare triple {14722#false} ~i~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 150: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 151: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,661 INFO L273 TraceCheckUtils]: 152: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 153: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 154: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 155: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 156: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 157: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,662 INFO L273 TraceCheckUtils]: 158: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 159: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 160: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 161: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 162: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 163: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,663 INFO L273 TraceCheckUtils]: 164: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 165: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 166: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 167: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 168: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 169: Hoare triple {14722#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14722#false} is VALID [2018-11-18 22:45:41,664 INFO L273 TraceCheckUtils]: 170: Hoare triple {14722#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L273 TraceCheckUtils]: 171: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L273 TraceCheckUtils]: 172: Hoare triple {14722#false} assume !(~i~0 < 100000); {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L273 TraceCheckUtils]: 173: Hoare triple {14722#false} havoc ~x~0;~x~0 := 0; {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L273 TraceCheckUtils]: 174: Hoare triple {14722#false} assume true; {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L273 TraceCheckUtils]: 175: Hoare triple {14722#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {14722#false} is VALID [2018-11-18 22:45:41,665 INFO L256 TraceCheckUtils]: 176: Hoare triple {14722#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {14722#false} is VALID [2018-11-18 22:45:41,666 INFO L273 TraceCheckUtils]: 177: Hoare triple {14722#false} ~cond := #in~cond; {14722#false} is VALID [2018-11-18 22:45:41,666 INFO L273 TraceCheckUtils]: 178: Hoare triple {14722#false} assume 0 == ~cond; {14722#false} is VALID [2018-11-18 22:45:41,666 INFO L273 TraceCheckUtils]: 179: Hoare triple {14722#false} assume !false; {14722#false} is VALID [2018-11-18 22:45:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:41,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:41,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:45:41,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2018-11-18 22:45:41,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:41,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:45:42,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:42,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:45:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:45:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:45:42,043 INFO L87 Difference]: Start difference. First operand 185 states and 191 transitions. Second operand 19 states. [2018-11-18 22:45:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:42,730 INFO L93 Difference]: Finished difference Result 321 states and 333 transitions. [2018-11-18 22:45:42,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:45:42,730 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2018-11-18 22:45:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:45:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-18 22:45:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:45:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-18 22:45:42,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 133 transitions. [2018-11-18 22:45:42,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:42,852 INFO L225 Difference]: With dead ends: 321 [2018-11-18 22:45:42,852 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 22:45:42,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:45:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 22:45:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-11-18 22:45:43,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:43,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 188 states. [2018-11-18 22:45:43,021 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 188 states. [2018-11-18 22:45:43,021 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 188 states. [2018-11-18 22:45:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:43,025 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2018-11-18 22:45:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2018-11-18 22:45:43,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:43,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:43,026 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 189 states. [2018-11-18 22:45:43,026 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 189 states. [2018-11-18 22:45:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:43,029 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2018-11-18 22:45:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2018-11-18 22:45:43,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:43,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:43,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:43,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 22:45:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 194 transitions. [2018-11-18 22:45:43,034 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 194 transitions. Word has length 180 [2018-11-18 22:45:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 194 transitions. [2018-11-18 22:45:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:45:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 194 transitions. [2018-11-18 22:45:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 22:45:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:43,036 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:43,037 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -183315328, now seen corresponding path program 15 times [2018-11-18 22:45:43,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:43,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:43,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16337#true} is VALID [2018-11-18 22:45:43,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {16337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16337#true} is VALID [2018-11-18 22:45:43,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:43,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #126#return; {16337#true} is VALID [2018-11-18 22:45:43,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret16 := main(); {16337#true} is VALID [2018-11-18 22:45:43,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {16337#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16339#(= main_~a~0 0)} is VALID [2018-11-18 22:45:43,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {16339#(= main_~a~0 0)} assume true; {16339#(= main_~a~0 0)} is VALID [2018-11-18 22:45:43,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {16339#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16339#(= main_~a~0 0)} is VALID [2018-11-18 22:45:43,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {16339#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16340#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:43,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {16340#(<= main_~a~0 1)} assume true; {16340#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:43,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {16340#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16340#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:43,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {16340#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16341#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:43,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {16341#(<= main_~a~0 2)} assume true; {16341#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:43,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {16341#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16341#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:43,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {16341#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16342#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:43,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {16342#(<= main_~a~0 3)} assume true; {16342#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:43,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {16342#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16342#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:43,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {16342#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16343#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:43,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {16343#(<= main_~a~0 4)} assume true; {16343#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:43,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {16343#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16343#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:43,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {16343#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16344#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:43,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {16344#(<= main_~a~0 5)} assume true; {16344#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:43,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {16344#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16344#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:43,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {16344#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16345#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:43,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {16345#(<= main_~a~0 6)} assume true; {16345#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:43,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {16345#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16345#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:43,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {16345#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16346#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:43,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {16346#(<= main_~a~0 7)} assume true; {16346#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:43,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {16346#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16346#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:43,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {16346#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16347#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:43,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {16347#(<= main_~a~0 8)} assume true; {16347#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:43,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {16347#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16347#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:43,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {16347#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16348#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:43,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {16348#(<= main_~a~0 9)} assume true; {16348#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:43,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {16348#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16348#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:43,462 INFO L273 TraceCheckUtils]: 35: Hoare triple {16348#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16349#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:43,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {16349#(<= main_~a~0 10)} assume true; {16349#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:43,463 INFO L273 TraceCheckUtils]: 37: Hoare triple {16349#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16349#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:43,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {16349#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16350#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:43,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {16350#(<= main_~a~0 11)} assume true; {16350#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:43,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {16350#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16350#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:43,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {16350#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16351#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:43,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {16351#(<= main_~a~0 12)} assume true; {16351#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:43,466 INFO L273 TraceCheckUtils]: 43: Hoare triple {16351#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16351#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:43,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {16351#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16352#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:43,467 INFO L273 TraceCheckUtils]: 45: Hoare triple {16352#(<= main_~a~0 13)} assume true; {16352#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:43,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {16352#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16352#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:43,468 INFO L273 TraceCheckUtils]: 47: Hoare triple {16352#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16353#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:43,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {16353#(<= main_~a~0 14)} assume true; {16353#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:43,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {16353#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16353#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:43,470 INFO L273 TraceCheckUtils]: 50: Hoare triple {16353#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16354#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:43,470 INFO L273 TraceCheckUtils]: 51: Hoare triple {16354#(<= main_~a~0 15)} assume true; {16354#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:43,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {16354#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16354#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:43,472 INFO L273 TraceCheckUtils]: 53: Hoare triple {16354#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16355#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:43,472 INFO L273 TraceCheckUtils]: 54: Hoare triple {16355#(<= main_~a~0 16)} assume true; {16355#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:43,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {16355#(<= main_~a~0 16)} assume !(~a~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,473 INFO L273 TraceCheckUtils]: 56: Hoare triple {16338#false} havoc ~i~0;~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,473 INFO L273 TraceCheckUtils]: 58: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,473 INFO L273 TraceCheckUtils]: 59: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,474 INFO L273 TraceCheckUtils]: 60: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,474 INFO L273 TraceCheckUtils]: 61: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,474 INFO L273 TraceCheckUtils]: 62: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,474 INFO L273 TraceCheckUtils]: 63: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,474 INFO L273 TraceCheckUtils]: 64: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 65: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 66: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 67: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 68: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 69: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 70: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 72: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 77: Hoare triple {16338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 81: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 82: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 83: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 84: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 85: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 86: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 88: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,477 INFO L273 TraceCheckUtils]: 89: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 92: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 96: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 97: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,478 INFO L273 TraceCheckUtils]: 98: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 100: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 101: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 102: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 104: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 105: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 106: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 107: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,479 INFO L273 TraceCheckUtils]: 108: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 109: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 111: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 112: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 113: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 114: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 115: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 116: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,480 INFO L273 TraceCheckUtils]: 117: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 118: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 119: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 120: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 121: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 122: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 123: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 124: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 125: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:43,481 INFO L273 TraceCheckUtils]: 126: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 127: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 128: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 129: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 130: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 131: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 132: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 133: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 134: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,482 INFO L273 TraceCheckUtils]: 135: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 136: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 137: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 138: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 139: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 140: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 141: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 142: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 143: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 144: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,483 INFO L273 TraceCheckUtils]: 145: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 146: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 147: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 148: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 149: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 150: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 151: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 152: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 153: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,484 INFO L273 TraceCheckUtils]: 154: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 155: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 156: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 157: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 158: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 159: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 160: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 161: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 162: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,485 INFO L273 TraceCheckUtils]: 163: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 164: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 165: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 166: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 167: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 168: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 169: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 170: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 171: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 172: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:43,486 INFO L273 TraceCheckUtils]: 173: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 174: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 175: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 176: Hoare triple {16338#false} havoc ~x~0;~x~0 := 0; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 177: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 178: Hoare triple {16338#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L256 TraceCheckUtils]: 179: Hoare triple {16338#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 180: Hoare triple {16338#false} ~cond := #in~cond; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 181: Hoare triple {16338#false} assume 0 == ~cond; {16338#false} is VALID [2018-11-18 22:45:43,487 INFO L273 TraceCheckUtils]: 182: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2018-11-18 22:45:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-18 22:45:43,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:43,505 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:45:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:45:49,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-18 22:45:49,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:49,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:49,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16337#true} is VALID [2018-11-18 22:45:49,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {16337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16337#true} is VALID [2018-11-18 22:45:49,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #126#return; {16337#true} is VALID [2018-11-18 22:45:49,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret16 := main(); {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {16337#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {16337#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {16337#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {16337#true} assume true; {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {16337#true} assume !(~a~0 < 100000); {16337#true} is VALID [2018-11-18 22:45:49,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {16337#true} havoc ~i~0;~i~0 := 0; {16527#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:49,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {16527#(<= main_~i~0 0)} assume true; {16527#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:49,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {16527#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16527#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:49,670 INFO L273 TraceCheckUtils]: 59: Hoare triple {16527#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16537#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:49,670 INFO L273 TraceCheckUtils]: 60: Hoare triple {16537#(<= main_~i~0 1)} assume true; {16537#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:49,670 INFO L273 TraceCheckUtils]: 61: Hoare triple {16537#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16537#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:49,671 INFO L273 TraceCheckUtils]: 62: Hoare triple {16537#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16547#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:49,671 INFO L273 TraceCheckUtils]: 63: Hoare triple {16547#(<= main_~i~0 2)} assume true; {16547#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:49,671 INFO L273 TraceCheckUtils]: 64: Hoare triple {16547#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16547#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:49,672 INFO L273 TraceCheckUtils]: 65: Hoare triple {16547#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16557#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:49,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {16557#(<= main_~i~0 3)} assume true; {16557#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:49,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {16557#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16557#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:49,673 INFO L273 TraceCheckUtils]: 68: Hoare triple {16557#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16567#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:49,674 INFO L273 TraceCheckUtils]: 69: Hoare triple {16567#(<= main_~i~0 4)} assume true; {16567#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:49,674 INFO L273 TraceCheckUtils]: 70: Hoare triple {16567#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16567#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:49,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {16567#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16577#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:49,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {16577#(<= main_~i~0 5)} assume true; {16577#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:49,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {16577#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16577#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:49,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {16577#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16587#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:49,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {16587#(<= main_~i~0 6)} assume true; {16587#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:49,678 INFO L273 TraceCheckUtils]: 76: Hoare triple {16587#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16587#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:49,679 INFO L273 TraceCheckUtils]: 77: Hoare triple {16587#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16597#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:49,679 INFO L273 TraceCheckUtils]: 78: Hoare triple {16597#(<= main_~i~0 7)} assume true; {16597#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:49,680 INFO L273 TraceCheckUtils]: 79: Hoare triple {16597#(<= main_~i~0 7)} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:49,680 INFO L273 TraceCheckUtils]: 80: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:49,680 INFO L273 TraceCheckUtils]: 81: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,681 INFO L273 TraceCheckUtils]: 83: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,681 INFO L273 TraceCheckUtils]: 84: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,681 INFO L273 TraceCheckUtils]: 85: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,681 INFO L273 TraceCheckUtils]: 86: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,681 INFO L273 TraceCheckUtils]: 87: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 88: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 89: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 91: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 92: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,682 INFO L273 TraceCheckUtils]: 93: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,683 INFO L273 TraceCheckUtils]: 94: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,683 INFO L273 TraceCheckUtils]: 95: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,683 INFO L273 TraceCheckUtils]: 96: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,683 INFO L273 TraceCheckUtils]: 97: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,683 INFO L273 TraceCheckUtils]: 98: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 99: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 100: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 101: Hoare triple {16338#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 102: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 103: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 104: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 105: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,684 INFO L273 TraceCheckUtils]: 106: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 107: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 108: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 109: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 110: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 111: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 112: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 113: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 114: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,685 INFO L273 TraceCheckUtils]: 115: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 116: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 117: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 118: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 119: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 120: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 121: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 122: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 123: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,686 INFO L273 TraceCheckUtils]: 124: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 125: Hoare triple {16338#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 126: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 127: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 128: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 129: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 130: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 131: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 132: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,687 INFO L273 TraceCheckUtils]: 133: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 134: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 135: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 136: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 137: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 138: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 139: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 140: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 141: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 142: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,688 INFO L273 TraceCheckUtils]: 143: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 144: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 145: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 146: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 147: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 148: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 149: Hoare triple {16338#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 150: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 151: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:49,689 INFO L273 TraceCheckUtils]: 152: Hoare triple {16338#false} ~i~0 := 0; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 153: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 154: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 155: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 156: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 157: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 158: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 159: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 160: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,690 INFO L273 TraceCheckUtils]: 161: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 162: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 163: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 164: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 165: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 166: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 167: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 168: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 169: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 170: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,691 INFO L273 TraceCheckUtils]: 171: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 172: Hoare triple {16338#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 173: Hoare triple {16338#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 174: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 175: Hoare triple {16338#false} assume !(~i~0 < 100000); {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 176: Hoare triple {16338#false} havoc ~x~0;~x~0 := 0; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 177: Hoare triple {16338#false} assume true; {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 178: Hoare triple {16338#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L256 TraceCheckUtils]: 179: Hoare triple {16338#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {16338#false} is VALID [2018-11-18 22:45:49,692 INFO L273 TraceCheckUtils]: 180: Hoare triple {16338#false} ~cond := #in~cond; {16338#false} is VALID [2018-11-18 22:45:49,693 INFO L273 TraceCheckUtils]: 181: Hoare triple {16338#false} assume 0 == ~cond; {16338#false} is VALID [2018-11-18 22:45:49,693 INFO L273 TraceCheckUtils]: 182: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2018-11-18 22:45:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-18 22:45:49,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:49,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2018-11-18 22:45:49,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 183 [2018-11-18 22:45:49,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:49,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:45:49,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:49,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:45:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:45:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:45:49,875 INFO L87 Difference]: Start difference. First operand 188 states and 194 transitions. Second operand 27 states. [2018-11-18 22:45:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:51,436 INFO L93 Difference]: Finished difference Result 344 states and 361 transitions. [2018-11-18 22:45:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:45:51,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 183 [2018-11-18 22:45:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:45:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 261 transitions. [2018-11-18 22:45:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:45:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 261 transitions. [2018-11-18 22:45:51,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 261 transitions. [2018-11-18 22:45:52,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:52,586 INFO L225 Difference]: With dead ends: 344 [2018-11-18 22:45:52,586 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 22:45:52,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:45:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 22:45:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2018-11-18 22:45:52,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:52,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 206 states. [2018-11-18 22:45:52,693 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 206 states. [2018-11-18 22:45:52,693 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 206 states. [2018-11-18 22:45:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:52,697 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2018-11-18 22:45:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 218 transitions. [2018-11-18 22:45:52,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:52,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:52,698 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 212 states. [2018-11-18 22:45:52,698 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 212 states. [2018-11-18 22:45:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:52,701 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2018-11-18 22:45:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 218 transitions. [2018-11-18 22:45:52,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:52,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:52,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:52,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-18 22:45:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 212 transitions. [2018-11-18 22:45:52,705 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 212 transitions. Word has length 183 [2018-11-18 22:45:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:52,705 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 212 transitions. [2018-11-18 22:45:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:45:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 212 transitions. [2018-11-18 22:45:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-18 22:45:52,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:52,707 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:52,707 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:52,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 94098121, now seen corresponding path program 16 times [2018-11-18 22:45:52,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:52,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:52,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:53,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {18069#true} call ULTIMATE.init(); {18069#true} is VALID [2018-11-18 22:45:53,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {18069#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18069#true} is VALID [2018-11-18 22:45:53,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {18069#true} assume true; {18069#true} is VALID [2018-11-18 22:45:53,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18069#true} {18069#true} #126#return; {18069#true} is VALID [2018-11-18 22:45:53,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {18069#true} call #t~ret16 := main(); {18069#true} is VALID [2018-11-18 22:45:53,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {18069#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18071#(= main_~a~0 0)} is VALID [2018-11-18 22:45:53,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {18071#(= main_~a~0 0)} assume true; {18071#(= main_~a~0 0)} is VALID [2018-11-18 22:45:53,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {18071#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18071#(= main_~a~0 0)} is VALID [2018-11-18 22:45:53,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {18071#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {18072#(<= main_~a~0 1)} assume true; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {18072#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {18072#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {18073#(<= main_~a~0 2)} assume true; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {18073#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {18073#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {18074#(<= main_~a~0 3)} assume true; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {18074#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {18074#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {18075#(<= main_~a~0 4)} assume true; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {18075#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {18075#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {18076#(<= main_~a~0 5)} assume true; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {18076#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {18076#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {18077#(<= main_~a~0 6)} assume true; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {18077#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {18077#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {18078#(<= main_~a~0 7)} assume true; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {18078#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {18078#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {18079#(<= main_~a~0 8)} assume true; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {18079#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {18079#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {18080#(<= main_~a~0 9)} assume true; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {18080#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,115 INFO L273 TraceCheckUtils]: 35: Hoare triple {18080#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {18081#(<= main_~a~0 10)} assume true; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {18081#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {18081#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {18082#(<= main_~a~0 11)} assume true; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {18082#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {18082#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,119 INFO L273 TraceCheckUtils]: 42: Hoare triple {18083#(<= main_~a~0 12)} assume true; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {18083#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {18083#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {18084#(<= main_~a~0 13)} assume true; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {18084#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {18084#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {18085#(<= main_~a~0 14)} assume true; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {18085#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {18085#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {18086#(<= main_~a~0 15)} assume true; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {18086#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {18086#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,126 INFO L273 TraceCheckUtils]: 54: Hoare triple {18087#(<= main_~a~0 16)} assume true; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {18087#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {18087#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18088#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:53,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {18088#(<= main_~a~0 17)} assume true; {18088#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:53,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {18088#(<= main_~a~0 17)} assume !(~a~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {18070#false} havoc ~i~0;~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 61: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 64: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,129 INFO L273 TraceCheckUtils]: 65: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,130 INFO L273 TraceCheckUtils]: 67: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,130 INFO L273 TraceCheckUtils]: 70: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 71: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 72: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 78: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 79: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,131 INFO L273 TraceCheckUtils]: 80: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 85: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 86: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 87: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 88: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,132 INFO L273 TraceCheckUtils]: 89: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 92: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 93: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 94: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 95: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 96: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 97: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,133 INFO L273 TraceCheckUtils]: 98: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 99: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 100: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 101: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 102: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 103: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 104: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 105: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 106: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,134 INFO L273 TraceCheckUtils]: 107: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 108: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 109: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 110: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 111: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 112: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 113: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,135 INFO L273 TraceCheckUtils]: 114: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 115: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 116: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 117: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 118: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 119: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 120: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 121: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 122: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,136 INFO L273 TraceCheckUtils]: 123: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 124: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 125: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 126: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 127: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 128: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 129: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 130: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 131: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,137 INFO L273 TraceCheckUtils]: 132: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 133: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 134: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 135: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 136: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 137: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 138: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 139: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,138 INFO L273 TraceCheckUtils]: 140: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 141: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 142: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 143: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 144: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 145: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 146: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,139 INFO L273 TraceCheckUtils]: 147: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 148: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 149: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 150: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 151: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 152: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 153: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 154: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 155: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,140 INFO L273 TraceCheckUtils]: 156: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 157: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 158: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 159: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 160: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 161: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 162: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,141 INFO L273 TraceCheckUtils]: 163: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 164: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 165: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 166: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 167: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 168: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,142 INFO L273 TraceCheckUtils]: 169: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 170: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 171: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 172: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 173: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 174: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,143 INFO L273 TraceCheckUtils]: 175: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 176: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 177: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 178: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 179: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 180: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,144 INFO L273 TraceCheckUtils]: 181: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 182: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 183: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 184: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 185: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 186: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 187: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,145 INFO L273 TraceCheckUtils]: 188: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 189: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 190: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 191: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 192: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 193: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,146 INFO L273 TraceCheckUtils]: 194: Hoare triple {18070#false} havoc ~x~0;~x~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L273 TraceCheckUtils]: 195: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L273 TraceCheckUtils]: 196: Hoare triple {18070#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L256 TraceCheckUtils]: 197: Hoare triple {18070#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L273 TraceCheckUtils]: 198: Hoare triple {18070#false} ~cond := #in~cond; {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L273 TraceCheckUtils]: 199: Hoare triple {18070#false} assume 0 == ~cond; {18070#false} is VALID [2018-11-18 22:45:53,147 INFO L273 TraceCheckUtils]: 200: Hoare triple {18070#false} assume !false; {18070#false} is VALID [2018-11-18 22:45:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-18 22:45:53,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:53,170 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:45:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:45:53,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:45:53,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:53,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:53,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {18069#true} call ULTIMATE.init(); {18069#true} is VALID [2018-11-18 22:45:53,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {18069#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18069#true} is VALID [2018-11-18 22:45:53,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {18069#true} assume true; {18069#true} is VALID [2018-11-18 22:45:53,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18069#true} {18069#true} #126#return; {18069#true} is VALID [2018-11-18 22:45:53,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {18069#true} call #t~ret16 := main(); {18069#true} is VALID [2018-11-18 22:45:53,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {18069#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18107#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:53,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {18107#(<= main_~a~0 0)} assume true; {18107#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:53,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {18107#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18107#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:53,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {18107#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {18072#(<= main_~a~0 1)} assume true; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {18072#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18072#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:53,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {18072#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {18073#(<= main_~a~0 2)} assume true; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {18073#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18073#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:53,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {18073#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {18074#(<= main_~a~0 3)} assume true; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {18074#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18074#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:53,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {18074#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {18075#(<= main_~a~0 4)} assume true; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {18075#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18075#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:53,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {18075#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {18076#(<= main_~a~0 5)} assume true; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {18076#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18076#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:53,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {18076#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {18077#(<= main_~a~0 6)} assume true; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {18077#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18077#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:53,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {18077#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {18078#(<= main_~a~0 7)} assume true; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {18078#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18078#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:53,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {18078#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {18079#(<= main_~a~0 8)} assume true; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {18079#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18079#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:53,638 INFO L273 TraceCheckUtils]: 32: Hoare triple {18079#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,639 INFO L273 TraceCheckUtils]: 33: Hoare triple {18080#(<= main_~a~0 9)} assume true; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,639 INFO L273 TraceCheckUtils]: 34: Hoare triple {18080#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18080#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:53,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {18080#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {18081#(<= main_~a~0 10)} assume true; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {18081#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18081#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:53,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {18081#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {18082#(<= main_~a~0 11)} assume true; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {18082#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18082#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:53,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {18082#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {18083#(<= main_~a~0 12)} assume true; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {18083#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18083#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:53,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {18083#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {18084#(<= main_~a~0 13)} assume true; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {18084#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18084#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:53,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {18084#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {18085#(<= main_~a~0 14)} assume true; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {18085#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18085#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:53,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {18085#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {18086#(<= main_~a~0 15)} assume true; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {18086#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18086#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:53,651 INFO L273 TraceCheckUtils]: 53: Hoare triple {18086#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {18087#(<= main_~a~0 16)} assume true; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,657 INFO L273 TraceCheckUtils]: 55: Hoare triple {18087#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18087#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:53,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {18087#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18088#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:53,658 INFO L273 TraceCheckUtils]: 57: Hoare triple {18088#(<= main_~a~0 17)} assume true; {18088#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {18088#(<= main_~a~0 17)} assume !(~a~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {18070#false} havoc ~i~0;~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 62: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 63: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,659 INFO L273 TraceCheckUtils]: 65: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,660 INFO L273 TraceCheckUtils]: 67: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 72: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 73: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 77: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 79: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 80: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 81: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,662 INFO L273 TraceCheckUtils]: 82: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18070#false} is VALID [2018-11-18 22:45:53,663 INFO L273 TraceCheckUtils]: 83: Hoare triple {18070#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18070#false} is VALID [2018-11-18 22:45:53,663 INFO L273 TraceCheckUtils]: 84: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,663 INFO L273 TraceCheckUtils]: 85: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,663 INFO L273 TraceCheckUtils]: 86: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,663 INFO L273 TraceCheckUtils]: 87: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 88: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 89: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 90: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 91: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 92: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 93: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 94: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 95: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 96: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,664 INFO L273 TraceCheckUtils]: 97: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 101: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 102: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 103: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 104: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 105: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,665 INFO L273 TraceCheckUtils]: 106: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 107: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 108: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 109: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 110: Hoare triple {18070#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 111: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 112: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 113: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 114: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 115: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,666 INFO L273 TraceCheckUtils]: 116: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 117: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 118: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 119: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 120: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 121: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 122: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 123: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 124: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 125: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,667 INFO L273 TraceCheckUtils]: 126: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 127: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 128: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 129: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 130: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 131: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 132: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 133: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 134: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,668 INFO L273 TraceCheckUtils]: 135: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 136: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 137: Hoare triple {18070#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 138: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 139: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 140: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 141: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 142: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,669 INFO L273 TraceCheckUtils]: 143: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 144: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 145: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 146: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 147: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 148: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,670 INFO L273 TraceCheckUtils]: 149: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 150: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 151: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 152: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 153: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 154: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,671 INFO L273 TraceCheckUtils]: 155: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 156: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 157: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 158: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 159: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 160: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,672 INFO L273 TraceCheckUtils]: 161: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 162: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 163: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 164: Hoare triple {18070#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 165: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 166: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 167: Hoare triple {18070#false} ~i~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,673 INFO L273 TraceCheckUtils]: 168: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 169: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 170: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 171: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 172: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 173: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,674 INFO L273 TraceCheckUtils]: 174: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 175: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 176: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 177: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 178: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 179: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 180: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,675 INFO L273 TraceCheckUtils]: 181: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 182: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 183: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 184: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 185: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 186: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 187: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,676 INFO L273 TraceCheckUtils]: 188: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 189: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 190: Hoare triple {18070#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 191: Hoare triple {18070#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 192: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 193: Hoare triple {18070#false} assume !(~i~0 < 100000); {18070#false} is VALID [2018-11-18 22:45:53,677 INFO L273 TraceCheckUtils]: 194: Hoare triple {18070#false} havoc ~x~0;~x~0 := 0; {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L273 TraceCheckUtils]: 195: Hoare triple {18070#false} assume true; {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L273 TraceCheckUtils]: 196: Hoare triple {18070#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L256 TraceCheckUtils]: 197: Hoare triple {18070#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L273 TraceCheckUtils]: 198: Hoare triple {18070#false} ~cond := #in~cond; {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L273 TraceCheckUtils]: 199: Hoare triple {18070#false} assume 0 == ~cond; {18070#false} is VALID [2018-11-18 22:45:53,678 INFO L273 TraceCheckUtils]: 200: Hoare triple {18070#false} assume !false; {18070#false} is VALID [2018-11-18 22:45:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-18 22:45:53,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:53,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:45:53,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 201 [2018-11-18 22:45:53,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:53,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:45:53,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:53,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:45:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:45:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:45:53,853 INFO L87 Difference]: Start difference. First operand 206 states and 212 transitions. Second operand 21 states. [2018-11-18 22:45:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:54,378 INFO L93 Difference]: Finished difference Result 357 states and 369 transitions. [2018-11-18 22:45:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:45:54,378 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 201 [2018-11-18 22:45:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:45:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-18 22:45:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:45:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-18 22:45:54,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2018-11-18 22:45:54,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:54,511 INFO L225 Difference]: With dead ends: 357 [2018-11-18 22:45:54,511 INFO L226 Difference]: Without dead ends: 210 [2018-11-18 22:45:54,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:45:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-18 22:45:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-11-18 22:45:54,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:54,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 209 states. [2018-11-18 22:45:54,756 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 209 states. [2018-11-18 22:45:54,756 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 209 states. [2018-11-18 22:45:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:54,760 INFO L93 Difference]: Finished difference Result 210 states and 216 transitions. [2018-11-18 22:45:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 216 transitions. [2018-11-18 22:45:54,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:54,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:54,761 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 210 states. [2018-11-18 22:45:54,761 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 210 states. [2018-11-18 22:45:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:54,766 INFO L93 Difference]: Finished difference Result 210 states and 216 transitions. [2018-11-18 22:45:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 216 transitions. [2018-11-18 22:45:54,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:54,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:54,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:54,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 22:45:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 215 transitions. [2018-11-18 22:45:54,771 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 215 transitions. Word has length 201 [2018-11-18 22:45:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:54,771 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 215 transitions. [2018-11-18 22:45:54,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:45:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 215 transitions. [2018-11-18 22:45:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 22:45:54,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:54,773 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:54,773 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:54,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1076891340, now seen corresponding path program 17 times [2018-11-18 22:45:54,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:54,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:55,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {19868#true} call ULTIMATE.init(); {19868#true} is VALID [2018-11-18 22:45:55,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {19868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19868#true} is VALID [2018-11-18 22:45:55,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {19868#true} assume true; {19868#true} is VALID [2018-11-18 22:45:55,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19868#true} {19868#true} #126#return; {19868#true} is VALID [2018-11-18 22:45:55,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {19868#true} call #t~ret16 := main(); {19868#true} is VALID [2018-11-18 22:45:55,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {19868#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19870#(= main_~a~0 0)} is VALID [2018-11-18 22:45:55,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {19870#(= main_~a~0 0)} assume true; {19870#(= main_~a~0 0)} is VALID [2018-11-18 22:45:55,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {19870#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19870#(= main_~a~0 0)} is VALID [2018-11-18 22:45:55,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {19870#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19871#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:55,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {19871#(<= main_~a~0 1)} assume true; {19871#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:55,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {19871#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19871#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:55,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {19871#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19872#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:55,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {19872#(<= main_~a~0 2)} assume true; {19872#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:55,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {19872#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19872#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:55,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {19872#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19873#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:55,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {19873#(<= main_~a~0 3)} assume true; {19873#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:55,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {19873#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19873#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:55,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {19873#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19874#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:55,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {19874#(<= main_~a~0 4)} assume true; {19874#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:55,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {19874#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19874#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:55,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {19874#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19875#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:55,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {19875#(<= main_~a~0 5)} assume true; {19875#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:55,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {19875#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19875#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:55,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {19875#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19876#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:55,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {19876#(<= main_~a~0 6)} assume true; {19876#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:55,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {19876#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19876#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:55,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {19876#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19877#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:55,312 INFO L273 TraceCheckUtils]: 27: Hoare triple {19877#(<= main_~a~0 7)} assume true; {19877#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:55,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {19877#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19877#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:55,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {19877#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19878#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:55,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {19878#(<= main_~a~0 8)} assume true; {19878#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:55,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {19878#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19878#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:55,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {19878#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19879#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:55,316 INFO L273 TraceCheckUtils]: 33: Hoare triple {19879#(<= main_~a~0 9)} assume true; {19879#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:55,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {19879#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19879#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:55,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {19879#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19880#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:55,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {19880#(<= main_~a~0 10)} assume true; {19880#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:55,318 INFO L273 TraceCheckUtils]: 37: Hoare triple {19880#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19880#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:55,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {19880#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19881#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:55,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {19881#(<= main_~a~0 11)} assume true; {19881#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:55,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {19881#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19881#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:55,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {19881#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19882#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:55,321 INFO L273 TraceCheckUtils]: 42: Hoare triple {19882#(<= main_~a~0 12)} assume true; {19882#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:55,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {19882#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19882#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:55,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {19882#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19883#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:55,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {19883#(<= main_~a~0 13)} assume true; {19883#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:55,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {19883#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19883#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:55,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {19883#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19884#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:55,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {19884#(<= main_~a~0 14)} assume true; {19884#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:55,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {19884#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19884#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:55,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {19884#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19885#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:55,326 INFO L273 TraceCheckUtils]: 51: Hoare triple {19885#(<= main_~a~0 15)} assume true; {19885#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:55,327 INFO L273 TraceCheckUtils]: 52: Hoare triple {19885#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19885#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:55,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {19885#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19886#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:55,328 INFO L273 TraceCheckUtils]: 54: Hoare triple {19886#(<= main_~a~0 16)} assume true; {19886#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:55,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {19886#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19886#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:55,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {19886#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19887#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:55,330 INFO L273 TraceCheckUtils]: 57: Hoare triple {19887#(<= main_~a~0 17)} assume true; {19887#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:55,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {19887#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19887#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:55,331 INFO L273 TraceCheckUtils]: 59: Hoare triple {19887#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19888#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:55,332 INFO L273 TraceCheckUtils]: 60: Hoare triple {19888#(<= main_~a~0 18)} assume true; {19888#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:55,332 INFO L273 TraceCheckUtils]: 61: Hoare triple {19888#(<= main_~a~0 18)} assume !(~a~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {19869#false} havoc ~i~0;~i~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,333 INFO L273 TraceCheckUtils]: 64: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,333 INFO L273 TraceCheckUtils]: 66: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,333 INFO L273 TraceCheckUtils]: 67: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 68: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 69: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 70: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 71: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 72: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,334 INFO L273 TraceCheckUtils]: 73: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 74: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 75: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 76: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 77: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 78: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,335 INFO L273 TraceCheckUtils]: 79: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,336 INFO L273 TraceCheckUtils]: 80: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,336 INFO L273 TraceCheckUtils]: 81: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,336 INFO L273 TraceCheckUtils]: 82: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,336 INFO L273 TraceCheckUtils]: 83: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,336 INFO L273 TraceCheckUtils]: 84: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {19869#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 88: Hoare triple {19869#false} assume !(~i~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 89: Hoare triple {19869#false} ~i~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 90: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 91: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 92: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,337 INFO L273 TraceCheckUtils]: 93: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 94: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 95: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 98: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 99: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 100: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 101: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 102: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,338 INFO L273 TraceCheckUtils]: 103: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 104: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 105: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 106: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 107: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 108: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 109: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 110: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 111: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,339 INFO L273 TraceCheckUtils]: 112: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 113: Hoare triple {19869#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 114: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 115: Hoare triple {19869#false} assume !(~i~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 116: Hoare triple {19869#false} ~i~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 117: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 118: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 119: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 120: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 121: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,340 INFO L273 TraceCheckUtils]: 122: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 123: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 124: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 125: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 126: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 127: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 128: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 129: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 130: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 131: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,341 INFO L273 TraceCheckUtils]: 132: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 133: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 134: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 135: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 136: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 137: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 138: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 139: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 140: Hoare triple {19869#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 141: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,342 INFO L273 TraceCheckUtils]: 142: Hoare triple {19869#false} assume !(~i~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 143: Hoare triple {19869#false} ~i~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 144: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 145: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 146: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 147: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 148: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 149: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 150: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,343 INFO L273 TraceCheckUtils]: 151: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 152: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 153: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 154: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 155: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 156: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 157: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 158: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 159: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 160: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,344 INFO L273 TraceCheckUtils]: 161: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 162: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 163: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 164: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 165: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 166: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 167: Hoare triple {19869#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 168: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 169: Hoare triple {19869#false} assume !(~i~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,345 INFO L273 TraceCheckUtils]: 170: Hoare triple {19869#false} ~i~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 171: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 172: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 173: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 174: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 175: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 176: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 177: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 178: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,346 INFO L273 TraceCheckUtils]: 179: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 180: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 181: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 182: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 183: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 184: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 185: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 186: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 187: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 188: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,347 INFO L273 TraceCheckUtils]: 189: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 190: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 191: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 192: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 193: Hoare triple {19869#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 194: Hoare triple {19869#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 195: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 196: Hoare triple {19869#false} assume !(~i~0 < 100000); {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 197: Hoare triple {19869#false} havoc ~x~0;~x~0 := 0; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 198: Hoare triple {19869#false} assume true; {19869#false} is VALID [2018-11-18 22:45:55,348 INFO L273 TraceCheckUtils]: 199: Hoare triple {19869#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {19869#false} is VALID [2018-11-18 22:45:55,349 INFO L256 TraceCheckUtils]: 200: Hoare triple {19869#false} call __VERIFIER_assert((if #t~mem14 == #t~mem15 then 1 else 0)); {19869#false} is VALID [2018-11-18 22:45:55,349 INFO L273 TraceCheckUtils]: 201: Hoare triple {19869#false} ~cond := #in~cond; {19869#false} is VALID [2018-11-18 22:45:55,349 INFO L273 TraceCheckUtils]: 202: Hoare triple {19869#false} assume 0 == ~cond; {19869#false} is VALID [2018-11-18 22:45:55,349 INFO L273 TraceCheckUtils]: 203: Hoare triple {19869#false} assume !false; {19869#false} is VALID [2018-11-18 22:45:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-18 22:45:55,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:55,366 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:45:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1