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-370d6ab [2018-11-14 16:50:35,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:50:35,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:50:35,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:50:35,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:50:35,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:50:35,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:50:35,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:50:35,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:50:35,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:50:35,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:50:35,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:50:35,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:50:35,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:50:35,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:50:35,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:50:35,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:50:35,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:50:35,858 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:50:35,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:50:35,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:50:35,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:50:35,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:50:35,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:50:35,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:50:35,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:50:35,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:50:35,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:50:35,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:50:35,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:50:35,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:50:35,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:50:35,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:50:35,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:50:35,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:50:35,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:50:35,893 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-14 16:50:35,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:50:35,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:50:35,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:50:35,923 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:50:35,923 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:50:35,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:50:35,924 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:50:35,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:50:35,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:50:35,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:50:35,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:50:35,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:50:35,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:50:35,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:50:35,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:50:35,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:50:35,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:50:35,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:50:35,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:50:35,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:50:35,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:50:35,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:50:35,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:50:35,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:50:35,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:50:35,930 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:50:35,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:50:35,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:50:35,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:50:35,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:50:36,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:50:36,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:50:36,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:50:36,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:50:36,025 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:50:36,026 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-14 16:50:36,097 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7e7375b/c815c50bdb6e4b478560f3d5aadd67bb/FLAG03d2890ad [2018-11-14 16:50:36,573 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:50:36,574 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_false-unreach-call_ground.i [2018-11-14 16:50:36,581 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7e7375b/c815c50bdb6e4b478560f3d5aadd67bb/FLAG03d2890ad [2018-11-14 16:50:36,598 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7e7375b/c815c50bdb6e4b478560f3d5aadd67bb [2018-11-14 16:50:36,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:50:36,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:50:36,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:36,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:50:36,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:50:36,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b2798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:36, skipping insertion in model container [2018-11-14 16:50:36,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:50:36" (1/1) ... [2018-11-14 16:50:36,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:50:36,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:50:36,952 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:36,959 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:50:37,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:50:37,035 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:50:37,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37 WrapperNode [2018-11-14 16:50:37,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:50:37,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:50:37,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:50:37,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:50:37,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (1/1) ... [2018-11-14 16:50:37,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:50:37,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:50:37,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:50:37,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:50:37,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (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-14 16:50:37,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:50:37,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:50:37,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:50:37,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:50:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:50:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:50:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:50:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:50:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:50:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:50:38,339 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:50:38,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:38 BoogieIcfgContainer [2018-11-14 16:50:38,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:50:38,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:50:38,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:50:38,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:50:38,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:50:36" (1/3) ... [2018-11-14 16:50:38,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c18cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:38, skipping insertion in model container [2018-11-14 16:50:38,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:50:37" (2/3) ... [2018-11-14 16:50:38,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c18cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:50:38, skipping insertion in model container [2018-11-14 16:50:38,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:50:38" (3/3) ... [2018-11-14 16:50:38,349 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_false-unreach-call_ground.i [2018-11-14 16:50:38,358 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:50:38,366 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:50:38,379 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:50:38,412 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:50:38,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:50:38,413 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:50:38,413 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:50:38,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:50:38,414 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:50:38,415 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:50:38,415 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:50:38,415 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:50:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-14 16:50:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:50:38,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:38,446 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-14 16:50:38,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:38,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash 663718763, now seen corresponding path program 1 times [2018-11-14 16:50:38,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:38,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:38,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-14 16:50:38,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49#true} is VALID [2018-11-14 16:50:38,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-14 16:50:38,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #126#return; {49#true} is VALID [2018-11-14 16:50:38,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret16 := main(); {49#true} is VALID [2018-11-14 16:50:38,647 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-14 16:50:38,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#true} assume !true; {50#false} is VALID [2018-11-14 16:50:38,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#false} havoc ~i~0;~i~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-14 16:50:38,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-14 16:50:38,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-14 16:50:38,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-14 16:50:38,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-14 16:50:38,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {50#false} havoc ~x~0;~x~0 := 0; {50#false} is VALID [2018-11-14 16:50:38,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-14 16:50:38,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {50#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {50#false} is VALID [2018-11-14 16:50:38,653 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-14 16:50:38,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2018-11-14 16:50:38,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {50#false} assume ~cond == 0; {50#false} is VALID [2018-11-14 16:50:38,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-14 16:50:38,659 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-14 16:50:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:50:38,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-14 16:50:38,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:38,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:50:38,779 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-14 16:50:38,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:50:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:50:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:50:38,791 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-14 16:50:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:38,921 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-14 16:50:38,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:50:38,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-14 16:50:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-14 16:50:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:50:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-14 16:50:38,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2018-11-14 16:50:39,511 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-14 16:50:39,528 INFO L225 Difference]: With dead ends: 83 [2018-11-14 16:50:39,528 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 16:50:39,533 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-14 16:50:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 16:50:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 16:50:39,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:39,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 16:50:39,634 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 16:50:39,634 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 16:50:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,640 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 16:50:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 16:50:39,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,641 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 16:50:39,641 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 16:50:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:39,646 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 16:50:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 16:50:39,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:39,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:39,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:39,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 16:50:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-14 16:50:39,654 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 24 [2018-11-14 16:50:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:39,654 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-14 16:50:39,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:50:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 16:50:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:50:39,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:39,656 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-14 16:50:39,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:39,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1010111724, now seen corresponding path program 1 times [2018-11-14 16:50:39,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:39,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:39,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2018-11-14 16:50:39,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {293#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {293#true} is VALID [2018-11-14 16:50:39,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2018-11-14 16:50:39,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #126#return; {293#true} is VALID [2018-11-14 16:50:39,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret16 := main(); {293#true} is VALID [2018-11-14 16:50:39,815 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-14 16:50:39,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {295#(= main_~a~0 0)} assume true; {295#(= main_~a~0 0)} is VALID [2018-11-14 16:50:39,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#(= main_~a~0 0)} assume !(~a~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {294#false} havoc ~i~0;~i~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {294#false} assume !(~i~0 < 100000); {294#false} is VALID [2018-11-14 16:50:39,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {294#false} havoc ~x~0;~x~0 := 0; {294#false} is VALID [2018-11-14 16:50:39,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {294#false} assume true; {294#false} is VALID [2018-11-14 16:50:39,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {294#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {294#false} is VALID [2018-11-14 16:50:39,824 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-14 16:50:39,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2018-11-14 16:50:39,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {294#false} assume ~cond == 0; {294#false} is VALID [2018-11-14 16:50:39,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {294#false} assume !false; {294#false} is VALID [2018-11-14 16:50:39,827 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-14 16:50:39,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:39,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:39,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:50:39,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:39,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:39,905 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-14 16:50:39,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:39,906 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-14 16:50:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,240 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 16:50:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:40,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:50:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 16:50:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 16:50:40,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-14 16:50:40,420 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-14 16:50:40,423 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:50:40,423 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:50:40,425 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-14 16:50:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:50:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-14 16:50:40,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:40,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-14 16:50:40,464 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-14 16:50:40,464 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-14 16:50:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,467 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 16:50:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 16:50:40,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,469 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-14 16:50:40,469 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-14 16:50:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:40,472 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 16:50:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 16:50:40,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:40,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:40,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:40,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 16:50:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-14 16:50:40,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2018-11-14 16:50:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:40,477 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-14 16:50:40,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 16:50:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:50:40,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:40,479 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-14 16:50:40,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:40,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:40,480 INFO L82 PathProgramCache]: Analyzing trace with hash -648560439, now seen corresponding path program 1 times [2018-11-14 16:50:40,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:40,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:40,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:40,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-14 16:50:40,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-14 16:50:40,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 16:50:40,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #126#return; {541#true} is VALID [2018-11-14 16:50:40,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret16 := main(); {541#true} is VALID [2018-11-14 16:50:40,573 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-14 16:50:40,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 16:50:40,573 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {541#true} is VALID [2018-11-14 16:50:40,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {541#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {541#true} is VALID [2018-11-14 16:50:40,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-14 16:50:40,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#true} assume !(~a~0 < 100000); {541#true} is VALID [2018-11-14 16:50:40,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#true} havoc ~i~0;~i~0 := 0; {543#(= main_~i~0 0)} is VALID [2018-11-14 16:50:40,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(= main_~i~0 0)} assume true; {543#(= main_~i~0 0)} is VALID [2018-11-14 16:50:40,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(= main_~i~0 0)} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-14 16:50:40,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-14 16:50:40,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:50:40,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-14 16:50:40,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-14 16:50:40,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:50:40,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-14 16:50:40,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-14 16:50:40,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:50:40,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-14 16:50:40,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-14 16:50:40,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:50:40,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {542#false} assume !(~i~0 < 100000); {542#false} is VALID [2018-11-14 16:50:40,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {542#false} havoc ~x~0;~x~0 := 0; {542#false} is VALID [2018-11-14 16:50:40,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-14 16:50:40,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {542#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {542#false} is VALID [2018-11-14 16:50:40,589 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-14 16:50:40,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-14 16:50:40,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {542#false} assume ~cond == 0; {542#false} is VALID [2018-11-14 16:50:40,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-14 16:50:40,592 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-14 16:50:40,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:50:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:50:40,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 16:50:40,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:40,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:50:40,715 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-14 16:50:40,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:50:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:50:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:50:40,716 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-14 16:50:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,056 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-11-14 16:50:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:50:41,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 16:50:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 16:50:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:50:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 16:50:41,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-14 16:50:41,260 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-14 16:50:41,263 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:50:41,263 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:50:41,264 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-14 16:50:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:50:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-11-14 16:50:41,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:41,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 53 states. [2018-11-14 16:50:41,302 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 53 states. [2018-11-14 16:50:41,302 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 53 states. [2018-11-14 16:50:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,305 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 16:50:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 16:50:41,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,306 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 58 states. [2018-11-14 16:50:41,306 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 58 states. [2018-11-14 16:50:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:41,310 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 16:50:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 16:50:41,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:41,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:41,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:41,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 16:50:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-14 16:50:41,314 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 33 [2018-11-14 16:50:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:41,314 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-14 16:50:41,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:50:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 16:50:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 16:50:41,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:41,316 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-14 16:50:41,316 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:41,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -940686717, now seen corresponding path program 1 times [2018-11-14 16:50:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2018-11-14 16:50:41,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {846#true} is VALID [2018-11-14 16:50:41,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2018-11-14 16:50:41,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #126#return; {846#true} is VALID [2018-11-14 16:50:41,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret16 := main(); {846#true} is VALID [2018-11-14 16:50:41,468 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-14 16:50:41,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {848#(= main_~a~0 0)} assume true; {848#(= main_~a~0 0)} is VALID [2018-11-14 16:50:41,473 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {848#(= main_~a~0 0)} is VALID [2018-11-14 16:50:41,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {849#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~a~0 1)} assume true; {849#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~a~0 1)} assume !(~a~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {847#false} havoc ~i~0;~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {847#false} is VALID [2018-11-14 16:50:41,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {847#false} is VALID [2018-11-14 16:50:41,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {847#false} is VALID [2018-11-14 16:50:41,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {847#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {847#false} is VALID [2018-11-14 16:50:41,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {847#false} is VALID [2018-11-14 16:50:41,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {847#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {847#false} is VALID [2018-11-14 16:50:41,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {847#false} is VALID [2018-11-14 16:50:41,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {847#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {847#false} is VALID [2018-11-14 16:50:41,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,488 INFO L273 TraceCheckUtils]: 36: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {847#false} is VALID [2018-11-14 16:50:41,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {847#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {847#false} is VALID [2018-11-14 16:50:41,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {847#false} havoc ~x~0;~x~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {847#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {847#false} is VALID [2018-11-14 16:50:41,490 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-14 16:50:41,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2018-11-14 16:50:41,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {847#false} assume ~cond == 0; {847#false} is VALID [2018-11-14 16:50:41,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {847#false} assume !false; {847#false} is VALID [2018-11-14 16:50:41,495 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-14 16:50:41,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:41,496 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-14 16:50:41,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:41,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:41,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2018-11-14 16:50:41,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {846#true} is VALID [2018-11-14 16:50:41,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2018-11-14 16:50:41,913 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #126#return; {846#true} is VALID [2018-11-14 16:50:41,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret16 := main(); {846#true} is VALID [2018-11-14 16:50:41,915 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-14 16:50:41,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(<= main_~a~0 0)} assume true; {868#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:41,916 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {868#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:41,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {868#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {849#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~a~0 1)} assume true; {849#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:41,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~a~0 1)} assume !(~a~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {847#false} havoc ~i~0;~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {847#false} is VALID [2018-11-14 16:50:41,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {847#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {847#false} is VALID [2018-11-14 16:50:41,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {847#false} is VALID [2018-11-14 16:50:41,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {847#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {847#false} is VALID [2018-11-14 16:50:41,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {847#false} is VALID [2018-11-14 16:50:41,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {847#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {847#false} is VALID [2018-11-14 16:50:41,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,927 INFO L273 TraceCheckUtils]: 31: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {847#false} is VALID [2018-11-14 16:50:41,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {847#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {847#false} is VALID [2018-11-14 16:50:41,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {847#false} ~i~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {847#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {847#false} is VALID [2018-11-14 16:50:41,929 INFO L273 TraceCheckUtils]: 38: Hoare triple {847#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {847#false} is VALID [2018-11-14 16:50:41,929 INFO L273 TraceCheckUtils]: 39: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {847#false} assume !(~i~0 < 100000); {847#false} is VALID [2018-11-14 16:50:41,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {847#false} havoc ~x~0;~x~0 := 0; {847#false} is VALID [2018-11-14 16:50:41,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {847#false} assume true; {847#false} is VALID [2018-11-14 16:50:41,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {847#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {847#false} is VALID [2018-11-14 16:50:41,930 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-14 16:50:41,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2018-11-14 16:50:41,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {847#false} assume ~cond == 0; {847#false} is VALID [2018-11-14 16:50:41,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {847#false} assume !false; {847#false} is VALID [2018-11-14 16:50:41,936 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-14 16:50:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:50:41,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-14 16:50:41,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:41,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:50:42,112 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-14 16:50:42,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:50:42,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:50:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:50:42,113 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2018-11-14 16:50:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,335 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-14 16:50:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:50:42,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-14 16:50:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:50:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 16:50:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:50:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 16:50:42,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2018-11-14 16:50:42,521 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-14 16:50:42,523 INFO L225 Difference]: With dead ends: 99 [2018-11-14 16:50:42,523 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 16:50:42,524 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-14 16:50:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 16:50:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-14 16:50:42,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:42,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-14 16:50:42,595 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-14 16:50:42,595 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-14 16:50:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,599 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 16:50:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-14 16:50:42,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,600 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-14 16:50:42,600 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-14 16:50:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:42,603 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 16:50:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-14 16:50:42,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:42,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:42,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:42,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:50:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-14 16:50:42,608 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 48 [2018-11-14 16:50:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:42,608 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-14 16:50:42,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:50:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-14 16:50:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:50:42,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:42,610 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-14 16:50:42,610 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:42,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2079494432, now seen corresponding path program 2 times [2018-11-14 16:50:42,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:50:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-14 16:50:42,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1316#true} is VALID [2018-11-14 16:50:42,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:42,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1316#true} {1316#true} #126#return; {1316#true} is VALID [2018-11-14 16:50:42,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {1316#true} call #t~ret16 := main(); {1316#true} is VALID [2018-11-14 16:50:42,743 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-14 16:50:42,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {1318#(= main_~a~0 0)} assume true; {1318#(= main_~a~0 0)} is VALID [2018-11-14 16:50:42,745 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1318#(= main_~a~0 0)} is VALID [2018-11-14 16:50:42,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {1318#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1319#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {1319#(<= main_~a~0 1)} assume true; {1319#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,755 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1319#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:42,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {1319#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1320#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:42,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {1320#(<= main_~a~0 2)} assume true; {1320#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:42,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {1320#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {1317#false} havoc ~i~0;~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1317#false} is VALID [2018-11-14 16:50:42,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {1317#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1317#false} is VALID [2018-11-14 16:50:42,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1317#false} is VALID [2018-11-14 16:50:42,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {1317#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1317#false} is VALID [2018-11-14 16:50:42,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1317#false} is VALID [2018-11-14 16:50:42,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {1317#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1317#false} is VALID [2018-11-14 16:50:42,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,763 INFO L273 TraceCheckUtils]: 33: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1317#false} is VALID [2018-11-14 16:50:42,763 INFO L273 TraceCheckUtils]: 35: Hoare triple {1317#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1317#false} is VALID [2018-11-14 16:50:42,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1317#false} is VALID [2018-11-14 16:50:42,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {1317#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1317#false} is VALID [2018-11-14 16:50:42,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,766 INFO L273 TraceCheckUtils]: 43: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:42,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {1317#false} havoc ~x~0;~x~0 := 0; {1317#false} is VALID [2018-11-14 16:50:42,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:42,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {1317#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {1317#false} is VALID [2018-11-14 16:50:42,767 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-14 16:50:42,767 INFO L273 TraceCheckUtils]: 48: Hoare triple {1317#false} ~cond := #in~cond; {1317#false} is VALID [2018-11-14 16:50:42,767 INFO L273 TraceCheckUtils]: 49: Hoare triple {1317#false} assume ~cond == 0; {1317#false} is VALID [2018-11-14 16:50:42,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-14 16:50:42,772 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-14 16:50:42,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:42,772 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-14 16:50:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:50:42,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:50:42,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:42,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:42,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-14 16:50:42,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1316#true} is VALID [2018-11-14 16:50:42,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:42,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1316#true} {1316#true} #126#return; {1316#true} is VALID [2018-11-14 16:50:42,998 INFO L256 TraceCheckUtils]: 4: Hoare triple {1316#true} call #t~ret16 := main(); {1316#true} is VALID [2018-11-14 16:50:42,999 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-14 16:50:42,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:42,999 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1316#true} is VALID [2018-11-14 16:50:42,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {1316#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1316#true} is VALID [2018-11-14 16:50:43,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,000 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1316#true} is VALID [2018-11-14 16:50:43,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {1316#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1316#true} is VALID [2018-11-14 16:50:43,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {1316#true} assume !(~a~0 < 100000); {1316#true} is VALID [2018-11-14 16:50:43,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {1316#true} havoc ~i~0;~i~0 := 0; {1316#true} is VALID [2018-11-14 16:50:43,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1316#true} is VALID [2018-11-14 16:50:43,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1316#true} is VALID [2018-11-14 16:50:43,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-14 16:50:43,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#true} ~i~0 := 0; {1316#true} is VALID [2018-11-14 16:50:43,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1316#true} is VALID [2018-11-14 16:50:43,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {1316#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1316#true} is VALID [2018-11-14 16:50:43,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-14 16:50:43,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {1316#true} ~i~0 := 0; {1316#true} is VALID [2018-11-14 16:50:43,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {1316#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1316#true} is VALID [2018-11-14 16:50:43,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {1316#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1316#true} is VALID [2018-11-14 16:50:43,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-14 16:50:43,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {1316#true} assume !(~i~0 < 100000); {1316#true} is VALID [2018-11-14 16:50:43,011 INFO L273 TraceCheckUtils]: 32: Hoare triple {1316#true} ~i~0 := 0; {1420#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {1420#(<= main_~i~0 0)} assume true; {1420#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,040 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 + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1420#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:43,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {1420#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1430#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:43,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {1430#(<= main_~i~0 1)} assume true; {1430#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:43,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {1430#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:43,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {1317#false} ~i~0 := 0; {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 40: Hoare triple {1317#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {1317#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {1317#false} assume !(~i~0 < 100000); {1317#false} is VALID [2018-11-14 16:50:43,050 INFO L273 TraceCheckUtils]: 44: Hoare triple {1317#false} havoc ~x~0;~x~0 := 0; {1317#false} is VALID [2018-11-14 16:50:43,051 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume true; {1317#false} is VALID [2018-11-14 16:50:43,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {1317#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {1317#false} is VALID [2018-11-14 16:50:43,051 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-14 16:50:43,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {1317#false} ~cond := #in~cond; {1317#false} is VALID [2018-11-14 16:50:43,051 INFO L273 TraceCheckUtils]: 49: Hoare triple {1317#false} assume ~cond == 0; {1317#false} is VALID [2018-11-14 16:50:43,052 INFO L273 TraceCheckUtils]: 50: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-14 16:50:43,055 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-14 16:50:43,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:43,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 16:50:43,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-14 16:50:43,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:43,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:50:43,236 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-14 16:50:43,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:50:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:50:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:50:43,237 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 7 states. [2018-11-14 16:50:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,693 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-11-14 16:50:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:43,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-14 16:50:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:50:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-14 16:50:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:50:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-14 16:50:43,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-14 16:50:43,936 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-14 16:50:43,939 INFO L225 Difference]: With dead ends: 122 [2018-11-14 16:50:43,939 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:50:43,940 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-14 16:50:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:50:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-14 16:50:43,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:43,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 74 states. [2018-11-14 16:50:43,971 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 74 states. [2018-11-14 16:50:43,971 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 74 states. [2018-11-14 16:50:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,975 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-14 16:50:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-11-14 16:50:43,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,976 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 80 states. [2018-11-14 16:50:43,976 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 80 states. [2018-11-14 16:50:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:43,980 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-11-14 16:50:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-11-14 16:50:43,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:43,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:43,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:43,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:50:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-14 16:50:43,984 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-14 16:50:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:43,984 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-14 16:50:43,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:50:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-14 16:50:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 16:50:43,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:43,987 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-14 16:50:43,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:43,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 990634025, now seen corresponding path program 3 times [2018-11-14 16:50:43,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:43,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:43,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:44,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-14 16:50:44,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1896#true} is VALID [2018-11-14 16:50:44,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #126#return; {1896#true} is VALID [2018-11-14 16:50:44,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret16 := main(); {1896#true} is VALID [2018-11-14 16:50:44,161 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-14 16:50:44,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {1898#(= main_~a~0 0)} assume true; {1898#(= main_~a~0 0)} is VALID [2018-11-14 16:50:44,163 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1898#(= main_~a~0 0)} is VALID [2018-11-14 16:50:44,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {1899#(<= main_~a~0 1)} assume true; {1899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,181 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1899#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:44,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {1899#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1900#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {1900#(<= main_~a~0 2)} assume true; {1900#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,183 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1900#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:44,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1901#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {1901#(<= main_~a~0 3)} assume true; {1901#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:44,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1901#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {1897#false} havoc ~i~0;~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1897#false} is VALID [2018-11-14 16:50:44,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {1897#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1897#false} is VALID [2018-11-14 16:50:44,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1897#false} is VALID [2018-11-14 16:50:44,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {1897#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1897#false} is VALID [2018-11-14 16:50:44,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1897#false} is VALID [2018-11-14 16:50:44,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {1897#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1897#false} is VALID [2018-11-14 16:50:44,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1897#false} is VALID [2018-11-14 16:50:44,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {1897#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1897#false} is VALID [2018-11-14 16:50:44,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {1897#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1897#false} is VALID [2018-11-14 16:50:44,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1897#false} is VALID [2018-11-14 16:50:44,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {1897#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1897#false} is VALID [2018-11-14 16:50:44,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-14 16:50:44,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1897#false} is VALID [2018-11-14 16:50:44,195 INFO L273 TraceCheckUtils]: 48: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 51: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 52: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 53: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 54: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 56: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1897#false} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 57: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1897#false} is VALID [2018-11-14 16:50:44,197 INFO L273 TraceCheckUtils]: 60: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 61: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 62: Hoare triple {1897#false} havoc ~x~0;~x~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {1897#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {1897#false} is VALID [2018-11-14 16:50:44,198 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-14 16:50:44,198 INFO L273 TraceCheckUtils]: 66: Hoare triple {1897#false} ~cond := #in~cond; {1897#false} is VALID [2018-11-14 16:50:44,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {1897#false} assume ~cond == 0; {1897#false} is VALID [2018-11-14 16:50:44,199 INFO L273 TraceCheckUtils]: 68: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-14 16:50:44,203 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-14 16:50:44,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:44,204 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-14 16:50:44,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:50:44,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:50:44,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:44,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:44,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {1896#true} call ULTIMATE.init(); {1896#true} is VALID [2018-11-14 16:50:44,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {1896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1896#true} is VALID [2018-11-14 16:50:44,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1896#true} {1896#true} #126#return; {1896#true} is VALID [2018-11-14 16:50:44,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {1896#true} call #t~ret16 := main(); {1896#true} is VALID [2018-11-14 16:50:44,579 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-14 16:50:44,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,579 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-14 16:50:44,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1896#true} is VALID [2018-11-14 16:50:44,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,580 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-14 16:50:44,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1896#true} is VALID [2018-11-14 16:50:44,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,581 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1896#true} is VALID [2018-11-14 16:50:44,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {1896#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1896#true} is VALID [2018-11-14 16:50:44,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {1896#true} assume !(~a~0 < 100000); {1896#true} is VALID [2018-11-14 16:50:44,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {1896#true} havoc ~i~0;~i~0 := 0; {1896#true} is VALID [2018-11-14 16:50:44,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1896#true} is VALID [2018-11-14 16:50:44,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {1896#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1896#true} is VALID [2018-11-14 16:50:44,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1896#true} is VALID [2018-11-14 16:50:44,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {1896#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1896#true} is VALID [2018-11-14 16:50:44,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,583 INFO L273 TraceCheckUtils]: 25: Hoare triple {1896#true} assume !(~i~0 < 100000); {1896#true} is VALID [2018-11-14 16:50:44,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {1896#true} ~i~0 := 0; {1896#true} is VALID [2018-11-14 16:50:44,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1896#true} is VALID [2018-11-14 16:50:44,584 INFO L273 TraceCheckUtils]: 29: Hoare triple {1896#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1896#true} is VALID [2018-11-14 16:50:44,584 INFO L273 TraceCheckUtils]: 30: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,585 INFO L273 TraceCheckUtils]: 31: Hoare triple {1896#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1896#true} is VALID [2018-11-14 16:50:44,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {1896#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1896#true} is VALID [2018-11-14 16:50:44,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {1896#true} assume true; {1896#true} is VALID [2018-11-14 16:50:44,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {1896#true} assume !(~i~0 < 100000); {1896#true} is VALID [2018-11-14 16:50:44,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {1896#true} ~i~0 := 0; {2010#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {2010#(<= main_~i~0 0)} assume true; {2010#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,593 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 + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2010#(<= main_~i~0 0)} is VALID [2018-11-14 16:50:44,593 INFO L273 TraceCheckUtils]: 38: Hoare triple {2010#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2020#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:44,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {2020#(<= main_~i~0 1)} assume true; {2020#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:44,594 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 + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2020#(<= main_~i~0 1)} is VALID [2018-11-14 16:50:44,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {2020#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2030#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:44,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {2030#(<= main_~i~0 2)} assume true; {2030#(<= main_~i~0 2)} is VALID [2018-11-14 16:50:44,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {2030#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {1897#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1897#false} is VALID [2018-11-14 16:50:44,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,597 INFO L273 TraceCheckUtils]: 52: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {1897#false} ~i~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,597 INFO L273 TraceCheckUtils]: 55: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-14 16:50:44,598 INFO L273 TraceCheckUtils]: 56: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1897#false} is VALID [2018-11-14 16:50:44,598 INFO L273 TraceCheckUtils]: 57: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,598 INFO L273 TraceCheckUtils]: 58: Hoare triple {1897#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1897#false} is VALID [2018-11-14 16:50:44,598 INFO L273 TraceCheckUtils]: 59: Hoare triple {1897#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1897#false} is VALID [2018-11-14 16:50:44,599 INFO L273 TraceCheckUtils]: 60: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {1897#false} assume !(~i~0 < 100000); {1897#false} is VALID [2018-11-14 16:50:44,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {1897#false} havoc ~x~0;~x~0 := 0; {1897#false} is VALID [2018-11-14 16:50:44,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {1897#false} assume true; {1897#false} is VALID [2018-11-14 16:50:44,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {1897#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {1897#false} is VALID [2018-11-14 16:50:44,599 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-14 16:50:44,599 INFO L273 TraceCheckUtils]: 66: Hoare triple {1897#false} ~cond := #in~cond; {1897#false} is VALID [2018-11-14 16:50:44,600 INFO L273 TraceCheckUtils]: 67: Hoare triple {1897#false} assume ~cond == 0; {1897#false} is VALID [2018-11-14 16:50:44,600 INFO L273 TraceCheckUtils]: 68: Hoare triple {1897#false} assume !false; {1897#false} is VALID [2018-11-14 16:50:44,604 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-14 16:50:44,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:44,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 16:50:44,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-14 16:50:44,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:44,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:50:44,704 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-14 16:50:44,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:50:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:50:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:50:44,705 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-11-14 16:50:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,456 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-11-14 16:50:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:50:45,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-14 16:50:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:50:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-14 16:50:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:50:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-14 16:50:45,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2018-11-14 16:50:45,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-14 16:50:45,720 INFO L225 Difference]: With dead ends: 155 [2018-11-14 16:50:45,720 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 16:50:45,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:50:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 16:50:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-11-14 16:50:45,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:45,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 92 states. [2018-11-14 16:50:45,806 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 92 states. [2018-11-14 16:50:45,806 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 92 states. [2018-11-14 16:50:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,811 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-14 16:50:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-11-14 16:50:45,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,812 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 98 states. [2018-11-14 16:50:45,812 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 98 states. [2018-11-14 16:50:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:45,815 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-14 16:50:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-11-14 16:50:45,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:45,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:45,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:45,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:50:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-11-14 16:50:45,819 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 69 [2018-11-14 16:50:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:45,820 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-11-14 16:50:45,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:50:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-11-14 16:50:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 16:50:45,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:45,821 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-14 16:50:45,822 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:45,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1388615872, now seen corresponding path program 4 times [2018-11-14 16:50:45,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:46,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {2636#true} call ULTIMATE.init(); {2636#true} is VALID [2018-11-14 16:50:46,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {2636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2636#true} is VALID [2018-11-14 16:50:46,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {2636#true} assume true; {2636#true} is VALID [2018-11-14 16:50:46,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2636#true} {2636#true} #126#return; {2636#true} is VALID [2018-11-14 16:50:46,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {2636#true} call #t~ret16 := main(); {2636#true} is VALID [2018-11-14 16:50:46,157 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-14 16:50:46,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(= main_~a~0 0)} assume true; {2638#(= main_~a~0 0)} is VALID [2018-11-14 16:50:46,158 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2638#(= main_~a~0 0)} is VALID [2018-11-14 16:50:46,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#(<= main_~a~0 1)} assume true; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,164 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~a~0 2)} assume true; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,167 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {2640#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~a~0 3)} assume true; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,171 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {2641#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2642#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:46,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {2642#(<= main_~a~0 4)} assume true; {2642#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {2637#false} havoc ~i~0;~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,180 INFO L273 TraceCheckUtils]: 48: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,180 INFO L273 TraceCheckUtils]: 49: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 50: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 51: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 53: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,181 INFO L273 TraceCheckUtils]: 55: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,182 INFO L273 TraceCheckUtils]: 58: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,182 INFO L273 TraceCheckUtils]: 59: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,182 INFO L273 TraceCheckUtils]: 60: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 61: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 62: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 63: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 64: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 65: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,183 INFO L273 TraceCheckUtils]: 66: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 67: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 68: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 69: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 71: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,184 INFO L273 TraceCheckUtils]: 72: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 77: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 78: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 79: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,185 INFO L273 TraceCheckUtils]: 80: Hoare triple {2637#false} havoc ~x~0;~x~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,186 INFO L273 TraceCheckUtils]: 81: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {2637#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {2637#false} is VALID [2018-11-14 16:50:46,186 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-14 16:50:46,186 INFO L273 TraceCheckUtils]: 84: Hoare triple {2637#false} ~cond := #in~cond; {2637#false} is VALID [2018-11-14 16:50:46,186 INFO L273 TraceCheckUtils]: 85: Hoare triple {2637#false} assume ~cond == 0; {2637#false} is VALID [2018-11-14 16:50:46,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {2637#false} assume !false; {2637#false} is VALID [2018-11-14 16:50:46,189 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-14 16:50:46,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:46,190 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-14 16:50:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:50:46,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:50:46,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:50:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:46,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:50:46,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {2636#true} call ULTIMATE.init(); {2636#true} is VALID [2018-11-14 16:50:46,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {2636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2636#true} is VALID [2018-11-14 16:50:46,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {2636#true} assume true; {2636#true} is VALID [2018-11-14 16:50:46,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2636#true} {2636#true} #126#return; {2636#true} is VALID [2018-11-14 16:50:46,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {2636#true} call #t~ret16 := main(); {2636#true} is VALID [2018-11-14 16:50:46,903 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-14 16:50:46,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {2661#(<= main_~a~0 0)} assume true; {2661#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:46,904 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2661#(<= main_~a~0 0)} is VALID [2018-11-14 16:50:46,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {2661#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#(<= main_~a~0 1)} assume true; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,905 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2639#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:46,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~a~0 2)} assume true; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,906 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2640#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:46,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {2640#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~a~0 3)} assume true; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,908 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2641#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:46,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {2641#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2642#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:46,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {2642#(<= main_~a~0 4)} assume true; {2642#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:46,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {2637#false} havoc ~i~0;~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2637#false} is VALID [2018-11-14 16:50:46,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {2637#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2637#false} is VALID [2018-11-14 16:50:46,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 35: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 36: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,915 INFO L273 TraceCheckUtils]: 38: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,915 INFO L273 TraceCheckUtils]: 39: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,915 INFO L273 TraceCheckUtils]: 40: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2637#false} is VALID [2018-11-14 16:50:46,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {2637#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2637#false} is VALID [2018-11-14 16:50:46,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 53: Hoare triple {2637#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 54: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,917 INFO L273 TraceCheckUtils]: 57: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 59: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 60: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2637#false} is VALID [2018-11-14 16:50:46,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {2637#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 66: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {2637#false} ~i~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,919 INFO L273 TraceCheckUtils]: 73: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 76: Hoare triple {2637#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {2637#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 78: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 79: Hoare triple {2637#false} assume !(~i~0 < 100000); {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 80: Hoare triple {2637#false} havoc ~x~0;~x~0 := 0; {2637#false} is VALID [2018-11-14 16:50:46,920 INFO L273 TraceCheckUtils]: 81: Hoare triple {2637#false} assume true; {2637#false} is VALID [2018-11-14 16:50:46,921 INFO L273 TraceCheckUtils]: 82: Hoare triple {2637#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {2637#false} is VALID [2018-11-14 16:50:46,921 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-14 16:50:46,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {2637#false} ~cond := #in~cond; {2637#false} is VALID [2018-11-14 16:50:46,921 INFO L273 TraceCheckUtils]: 85: Hoare triple {2637#false} assume ~cond == 0; {2637#false} is VALID [2018-11-14 16:50:46,921 INFO L273 TraceCheckUtils]: 86: Hoare triple {2637#false} assume !false; {2637#false} is VALID [2018-11-14 16:50:46,924 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-14 16:50:46,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:50:46,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:50:46,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-14 16:50:46,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:50:46,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:50:47,029 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-14 16:50:47,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:50:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:50:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:50:47,030 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 8 states. [2018-11-14 16:50:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,382 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-11-14 16:50:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:50:47,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-14 16:50:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:50:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-14 16:50:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:50:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2018-11-14 16:50:47,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2018-11-14 16:50:47,559 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-14 16:50:47,561 INFO L225 Difference]: With dead ends: 168 [2018-11-14 16:50:47,561 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:50:47,562 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-14 16:50:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:50:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 16:50:47,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:50:47,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 16:50:47,601 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 16:50:47,601 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 16:50:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,604 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-14 16:50:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-11-14 16:50:47,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,605 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 16:50:47,605 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 16:50:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:50:47,608 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-14 16:50:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-11-14 16:50:47,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:50:47,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:50:47,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:50:47,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:50:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 16:50:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-11-14 16:50:47,612 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 87 [2018-11-14 16:50:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:50:47,612 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-11-14 16:50:47,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:50:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-14 16:50:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 16:50:47,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:50:47,613 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-14 16:50:47,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:50:47,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:50:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1862353795, now seen corresponding path program 5 times [2018-11-14 16:50:47,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:50:47,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:50:47,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:50:47,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:50:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:50:47,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 16:50:47,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3448#true} is VALID [2018-11-14 16:50:47,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:50:47,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #126#return; {3448#true} is VALID [2018-11-14 16:50:47,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret16 := main(); {3448#true} is VALID [2018-11-14 16:50:47,894 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-14 16:50:47,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {3450#(= main_~a~0 0)} assume true; {3450#(= main_~a~0 0)} is VALID [2018-11-14 16:50:47,895 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3450#(= main_~a~0 0)} is VALID [2018-11-14 16:50:47,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {3450#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3451#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:47,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {3451#(<= main_~a~0 1)} assume true; {3451#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:47,896 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3451#(<= main_~a~0 1)} is VALID [2018-11-14 16:50:47,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {3451#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3452#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:47,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {3452#(<= main_~a~0 2)} assume true; {3452#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:47,901 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3452#(<= main_~a~0 2)} is VALID [2018-11-14 16:50:47,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {3452#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3453#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:47,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {3453#(<= main_~a~0 3)} assume true; {3453#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:47,902 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3453#(<= main_~a~0 3)} is VALID [2018-11-14 16:50:47,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {3453#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3454#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:47,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {3454#(<= main_~a~0 4)} assume true; {3454#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:47,903 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3454#(<= main_~a~0 4)} is VALID [2018-11-14 16:50:47,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {3454#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3455#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:47,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {3455#(<= main_~a~0 5)} assume true; {3455#(<= main_~a~0 5)} is VALID [2018-11-14 16:50:47,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {3455#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {3449#false} havoc ~i~0;~i~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-14 16:50:47,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3449#false} is VALID [2018-11-14 16:50:47,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-14 16:50:47,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3449#false} is VALID [2018-11-14 16:50:47,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3449#false} is VALID [2018-11-14 16:50:47,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3449#false} is VALID [2018-11-14 16:50:47,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 41: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 42: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {3449#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 49: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3449#false} is VALID [2018-11-14 16:50:47,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {3449#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 59: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:50:47,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 64: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 65: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 67: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 68: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:50:47,911 INFO L273 TraceCheckUtils]: 69: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,912 INFO L273 TraceCheckUtils]: 70: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,912 INFO L273 TraceCheckUtils]: 71: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,912 INFO L273 TraceCheckUtils]: 72: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,912 INFO L273 TraceCheckUtils]: 73: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:50:47,912 INFO L273 TraceCheckUtils]: 74: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:50:47,913 INFO L273 TraceCheckUtils]: 75: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,913 INFO L273 TraceCheckUtils]: 76: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:50:47,913 INFO L273 TraceCheckUtils]: 77: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:50:47,913 INFO L273 TraceCheckUtils]: 78: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,913 INFO L273 TraceCheckUtils]: 79: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 80: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 81: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 82: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 83: Hoare triple {3449#false} havoc ~x~0;~x~0 := 0; {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 84: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:50:47,914 INFO L273 TraceCheckUtils]: 85: Hoare triple {3449#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {3449#false} is VALID [2018-11-14 16:50:47,915 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-14 16:50:47,915 INFO L273 TraceCheckUtils]: 87: Hoare triple {3449#false} ~cond := #in~cond; {3449#false} is VALID [2018-11-14 16:50:47,915 INFO L273 TraceCheckUtils]: 88: Hoare triple {3449#false} assume ~cond == 0; {3449#false} is VALID [2018-11-14 16:50:47,915 INFO L273 TraceCheckUtils]: 89: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 16:50:47,920 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-14 16:50:47,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:50:47,920 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-14 16:50:47,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:51:01,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:51:01,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:01,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:01,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 16:51:01,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3448#true} is VALID [2018-11-14 16:51:01,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #126#return; {3448#true} is VALID [2018-11-14 16:51:01,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret16 := main(); {3448#true} is VALID [2018-11-14 16:51:01,712 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-14 16:51:01,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,712 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-14 16:51:01,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3448#true} is VALID [2018-11-14 16:51:01,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,712 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-14 16:51:01,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3448#true} is VALID [2018-11-14 16:51:01,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,713 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-14 16:51:01,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3448#true} is VALID [2018-11-14 16:51:01,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,713 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-14 16:51:01,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3448#true} is VALID [2018-11-14 16:51:01,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,713 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {3448#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {3448#true} assume !(~a~0 < 100000); {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {3448#true} havoc ~i~0;~i~0 := 0; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3448#true} is VALID [2018-11-14 16:51:01,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {3448#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3448#true} is VALID [2018-11-14 16:51:01,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {3448#true} assume !(~i~0 < 100000); {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {3448#true} ~i~0 := 0; {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {3448#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3448#true} is VALID [2018-11-14 16:51:01,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3448#true} is VALID [2018-11-14 16:51:01,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {3448#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3448#true} is VALID [2018-11-14 16:51:01,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {3448#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3448#true} is VALID [2018-11-14 16:51:01,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {3448#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3448#true} is VALID [2018-11-14 16:51:01,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 16:51:01,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {3448#true} assume !(~i~0 < 100000); {3448#true} is VALID [2018-11-14 16:51:01,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {3448#true} ~i~0 := 0; {3600#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:01,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {3600#(<= main_~i~0 0)} assume true; {3600#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:01,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {3600#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3600#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:01,725 INFO L273 TraceCheckUtils]: 50: Hoare triple {3600#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:01,725 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#(<= main_~i~0 1)} assume true; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:01,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3610#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:01,727 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3620#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:01,730 INFO L273 TraceCheckUtils]: 54: Hoare triple {3620#(<= main_~i~0 2)} assume true; {3620#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:01,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {3620#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3620#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:01,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {3620#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3630#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:01,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {3630#(<= main_~i~0 3)} assume true; {3630#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {3630#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 59: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 60: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 61: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 62: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 63: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 67: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 68: Hoare triple {3449#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 70: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 71: Hoare triple {3449#false} ~i~0 := 0; {3449#false} is VALID [2018-11-14 16:51:01,736 INFO L273 TraceCheckUtils]: 72: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 73: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 74: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 75: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 76: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 77: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 78: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 79: Hoare triple {3449#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3449#false} is VALID [2018-11-14 16:51:01,737 INFO L273 TraceCheckUtils]: 80: Hoare triple {3449#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 81: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 82: Hoare triple {3449#false} assume !(~i~0 < 100000); {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 83: Hoare triple {3449#false} havoc ~x~0;~x~0 := 0; {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 84: Hoare triple {3449#false} assume true; {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 85: Hoare triple {3449#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {3449#false} is VALID [2018-11-14 16:51:01,738 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-14 16:51:01,738 INFO L273 TraceCheckUtils]: 87: Hoare triple {3449#false} ~cond := #in~cond; {3449#false} is VALID [2018-11-14 16:51:01,738 INFO L273 TraceCheckUtils]: 88: Hoare triple {3449#false} assume ~cond == 0; {3449#false} is VALID [2018-11-14 16:51:01,739 INFO L273 TraceCheckUtils]: 89: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 16:51:01,743 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-14 16:51:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:01,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 16:51:01,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-14 16:51:01,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:01,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:51:01,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:51:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:51:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:51:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:51:01,839 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 12 states. [2018-11-14 16:51:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:02,802 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-11-14 16:51:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:51:02,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2018-11-14 16:51:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:51:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-14 16:51:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:51:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-14 16:51:02,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 168 transitions. [2018-11-14 16:51:03,131 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-14 16:51:03,134 INFO L225 Difference]: With dead ends: 191 [2018-11-14 16:51:03,134 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 16:51:03,135 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-14 16:51:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 16:51:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-11-14 16:51:03,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:03,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 113 states. [2018-11-14 16:51:03,184 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 113 states. [2018-11-14 16:51:03,184 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 113 states. [2018-11-14 16:51:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:03,188 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-14 16:51:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-14 16:51:03,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:03,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:03,189 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 119 states. [2018-11-14 16:51:03,189 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 119 states. [2018-11-14 16:51:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:03,192 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-11-14 16:51:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-14 16:51:03,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:03,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:03,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:03,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 16:51:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-11-14 16:51:03,197 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 90 [2018-11-14 16:51:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:03,198 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-11-14 16:51:03,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:51:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-14 16:51:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-14 16:51:03,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:03,199 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-14 16:51:03,199 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:03,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -828151924, now seen corresponding path program 6 times [2018-11-14 16:51:03,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:03,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:03,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2018-11-14 16:51:03,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4372#true} is VALID [2018-11-14 16:51:03,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2018-11-14 16:51:03,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #126#return; {4372#true} is VALID [2018-11-14 16:51:03,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret16 := main(); {4372#true} is VALID [2018-11-14 16:51:03,897 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-14 16:51:03,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {4374#(= main_~a~0 0)} assume true; {4374#(= main_~a~0 0)} is VALID [2018-11-14 16:51:03,897 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4374#(= main_~a~0 0)} is VALID [2018-11-14 16:51:03,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {4374#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:03,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {4375#(<= main_~a~0 1)} assume true; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:03,921 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:03,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {4375#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:03,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {4376#(<= main_~a~0 2)} assume true; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:03,934 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:03,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {4376#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:03,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {4377#(<= main_~a~0 3)} assume true; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:03,936 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:03,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {4377#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:03,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {4378#(<= main_~a~0 4)} assume true; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:03,937 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:03,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:03,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {4379#(<= main_~a~0 5)} assume true; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:03,938 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:03,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4380#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:03,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~a~0 6)} assume true; {4380#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:03,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {4373#false} havoc ~i~0;~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:03,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:03,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:03,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:03,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,942 INFO L273 TraceCheckUtils]: 34: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:03,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:03,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:03,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:03,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,943 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,943 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,944 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:03,944 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:03,944 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,944 INFO L273 TraceCheckUtils]: 46: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:03,945 INFO L273 TraceCheckUtils]: 47: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:03,946 INFO L273 TraceCheckUtils]: 48: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,946 INFO L273 TraceCheckUtils]: 49: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:03,946 INFO L273 TraceCheckUtils]: 50: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:03,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 54: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 56: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,947 INFO L273 TraceCheckUtils]: 57: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,948 INFO L273 TraceCheckUtils]: 58: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:03,948 INFO L273 TraceCheckUtils]: 59: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:03,948 INFO L273 TraceCheckUtils]: 60: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:03,948 INFO L273 TraceCheckUtils]: 62: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 63: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 64: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 65: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 66: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 67: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:03,949 INFO L273 TraceCheckUtils]: 68: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:03,950 INFO L273 TraceCheckUtils]: 69: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,950 INFO L273 TraceCheckUtils]: 70: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,950 INFO L273 TraceCheckUtils]: 71: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,950 INFO L273 TraceCheckUtils]: 72: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 74: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 75: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 76: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 77: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 78: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,951 INFO L273 TraceCheckUtils]: 79: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:03,952 INFO L273 TraceCheckUtils]: 80: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:03,952 INFO L273 TraceCheckUtils]: 81: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,952 INFO L273 TraceCheckUtils]: 82: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:03,952 INFO L273 TraceCheckUtils]: 83: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:03,952 INFO L273 TraceCheckUtils]: 84: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 85: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 86: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 87: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 88: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 89: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:03,953 INFO L273 TraceCheckUtils]: 90: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,954 INFO L273 TraceCheckUtils]: 91: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:03,954 INFO L273 TraceCheckUtils]: 92: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:03,954 INFO L273 TraceCheckUtils]: 93: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,954 INFO L273 TraceCheckUtils]: 94: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:03,954 INFO L273 TraceCheckUtils]: 95: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 96: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 97: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 99: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 100: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 101: Hoare triple {4373#false} havoc ~x~0;~x~0 := 0; {4373#false} is VALID [2018-11-14 16:51:03,955 INFO L273 TraceCheckUtils]: 102: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:03,956 INFO L273 TraceCheckUtils]: 103: Hoare triple {4373#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {4373#false} is VALID [2018-11-14 16:51:03,956 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-14 16:51:03,956 INFO L273 TraceCheckUtils]: 105: Hoare triple {4373#false} ~cond := #in~cond; {4373#false} is VALID [2018-11-14 16:51:03,956 INFO L273 TraceCheckUtils]: 106: Hoare triple {4373#false} assume ~cond == 0; {4373#false} is VALID [2018-11-14 16:51:03,956 INFO L273 TraceCheckUtils]: 107: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2018-11-14 16:51:03,963 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-14 16:51:03,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:03,963 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-14 16:51:03,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:51:05,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:51:05,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:05,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:05,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2018-11-14 16:51:06,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4372#true} is VALID [2018-11-14 16:51:06,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2018-11-14 16:51:06,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #126#return; {4372#true} is VALID [2018-11-14 16:51:06,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret16 := main(); {4372#true} is VALID [2018-11-14 16:51:06,002 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-14 16:51:06,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {4399#(<= main_~a~0 0)} assume true; {4399#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:06,003 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4399#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:06,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {4399#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:06,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {4375#(<= main_~a~0 1)} assume true; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:06,004 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4375#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:06,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {4375#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:06,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {4376#(<= main_~a~0 2)} assume true; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:06,006 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4376#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:06,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {4376#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:06,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {4377#(<= main_~a~0 3)} assume true; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:06,008 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4377#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:06,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {4377#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:06,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {4378#(<= main_~a~0 4)} assume true; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:06,009 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4378#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:06,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {4378#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:06,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {4379#(<= main_~a~0 5)} assume true; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:06,011 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {4379#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:06,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {4379#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4380#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:06,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {4380#(<= main_~a~0 6)} assume true; {4380#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:06,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {4380#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {4373#false} havoc ~i~0;~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:06,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:06,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,015 INFO L273 TraceCheckUtils]: 31: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:06,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:06,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:06,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {4373#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:06,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {4373#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 60: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 65: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:06,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 67: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 68: Hoare triple {4373#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 70: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 74: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:06,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 77: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 78: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {4373#false} is VALID [2018-11-14 16:51:06,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {4373#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 86: Hoare triple {4373#false} ~i~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 87: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 88: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 89: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 90: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 91: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:06,022 INFO L273 TraceCheckUtils]: 92: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 93: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 94: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 95: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 96: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 97: Hoare triple {4373#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {4373#false} is VALID [2018-11-14 16:51:06,023 INFO L273 TraceCheckUtils]: 98: Hoare triple {4373#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 99: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 100: Hoare triple {4373#false} assume !(~i~0 < 100000); {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 101: Hoare triple {4373#false} havoc ~x~0;~x~0 := 0; {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 102: Hoare triple {4373#false} assume true; {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 103: Hoare triple {4373#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {4373#false} is VALID [2018-11-14 16:51:06,024 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-14 16:51:06,024 INFO L273 TraceCheckUtils]: 105: Hoare triple {4373#false} ~cond := #in~cond; {4373#false} is VALID [2018-11-14 16:51:06,024 INFO L273 TraceCheckUtils]: 106: Hoare triple {4373#false} assume ~cond == 0; {4373#false} is VALID [2018-11-14 16:51:06,025 INFO L273 TraceCheckUtils]: 107: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2018-11-14 16:51:06,031 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-14 16:51:06,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:06,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:51:06,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-11-14 16:51:06,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:06,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:51:06,112 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-14 16:51:06,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:51:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:51:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:51:06,114 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 10 states. [2018-11-14 16:51:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:06,448 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-11-14 16:51:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:51:06,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-11-14 16:51:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:51:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-14 16:51:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:51:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-14 16:51:06,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2018-11-14 16:51:06,630 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-14 16:51:06,632 INFO L225 Difference]: With dead ends: 204 [2018-11-14 16:51:06,632 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 16:51:06,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:51:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 16:51:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-14 16:51:06,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:06,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 116 states. [2018-11-14 16:51:06,754 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 116 states. [2018-11-14 16:51:06,754 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 116 states. [2018-11-14 16:51:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:06,758 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-14 16:51:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-14 16:51:06,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:06,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:06,759 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 117 states. [2018-11-14 16:51:06,759 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 117 states. [2018-11-14 16:51:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:06,763 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-14 16:51:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-14 16:51:06,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:06,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:06,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:06,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-14 16:51:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-11-14 16:51:06,767 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 108 [2018-11-14 16:51:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:06,767 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-11-14 16:51:06,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:51:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-11-14 16:51:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-14 16:51:06,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:06,769 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-14 16:51:06,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:06,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 900867241, now seen corresponding path program 7 times [2018-11-14 16:51:06,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:06,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:07,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2018-11-14 16:51:07,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {5367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5367#true} is VALID [2018-11-14 16:51:07,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2018-11-14 16:51:07,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #126#return; {5367#true} is VALID [2018-11-14 16:51:07,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret16 := main(); {5367#true} is VALID [2018-11-14 16:51:07,390 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-14 16:51:07,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {5369#(= main_~a~0 0)} assume true; {5369#(= main_~a~0 0)} is VALID [2018-11-14 16:51:07,391 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5369#(= main_~a~0 0)} is VALID [2018-11-14 16:51:07,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {5369#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {5370#(<= main_~a~0 1)} assume true; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,392 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {5370#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {5371#(<= main_~a~0 2)} assume true; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,395 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {5371#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {5372#(<= main_~a~0 3)} assume true; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,397 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {5372#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {5373#(<= main_~a~0 4)} assume true; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,399 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {5373#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {5374#(<= main_~a~0 5)} assume true; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,401 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~a~0 6)} assume true; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,403 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {5375#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5376#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:07,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {5376#(<= main_~a~0 7)} assume true; {5376#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:07,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {5376#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {5368#false} havoc ~i~0;~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 57: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 58: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 59: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,411 INFO L273 TraceCheckUtils]: 61: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 62: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 63: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 64: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 65: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 66: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 67: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,412 INFO L273 TraceCheckUtils]: 68: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 70: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 71: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 72: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 73: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,413 INFO L273 TraceCheckUtils]: 74: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,414 INFO L273 TraceCheckUtils]: 75: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,414 INFO L273 TraceCheckUtils]: 76: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,414 INFO L273 TraceCheckUtils]: 77: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,414 INFO L273 TraceCheckUtils]: 78: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,414 INFO L273 TraceCheckUtils]: 79: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,415 INFO L273 TraceCheckUtils]: 82: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,415 INFO L273 TraceCheckUtils]: 83: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,416 INFO L273 TraceCheckUtils]: 85: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,416 INFO L273 TraceCheckUtils]: 86: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,416 INFO L273 TraceCheckUtils]: 87: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,417 INFO L273 TraceCheckUtils]: 92: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,417 INFO L273 TraceCheckUtils]: 93: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,417 INFO L273 TraceCheckUtils]: 94: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,418 INFO L273 TraceCheckUtils]: 95: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,418 INFO L273 TraceCheckUtils]: 96: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,418 INFO L273 TraceCheckUtils]: 97: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,418 INFO L273 TraceCheckUtils]: 98: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,418 INFO L273 TraceCheckUtils]: 99: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,419 INFO L273 TraceCheckUtils]: 100: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,419 INFO L273 TraceCheckUtils]: 101: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,419 INFO L273 TraceCheckUtils]: 102: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,419 INFO L273 TraceCheckUtils]: 103: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {5368#false} havoc ~x~0;~x~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,420 INFO L273 TraceCheckUtils]: 105: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,420 INFO L273 TraceCheckUtils]: 106: Hoare triple {5368#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {5368#false} is VALID [2018-11-14 16:51:07,420 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-14 16:51:07,420 INFO L273 TraceCheckUtils]: 108: Hoare triple {5368#false} ~cond := #in~cond; {5368#false} is VALID [2018-11-14 16:51:07,421 INFO L273 TraceCheckUtils]: 109: Hoare triple {5368#false} assume ~cond == 0; {5368#false} is VALID [2018-11-14 16:51:07,421 INFO L273 TraceCheckUtils]: 110: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2018-11-14 16:51:07,434 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-14 16:51:07,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:07,434 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-14 16:51:07,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:07,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:07,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2018-11-14 16:51:07,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {5367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5367#true} is VALID [2018-11-14 16:51:07,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2018-11-14 16:51:07,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #126#return; {5367#true} is VALID [2018-11-14 16:51:07,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret16 := main(); {5367#true} is VALID [2018-11-14 16:51:07,684 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-14 16:51:07,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {5395#(<= main_~a~0 0)} assume true; {5395#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:07,685 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5395#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:07,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {5395#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {5370#(<= main_~a~0 1)} assume true; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,686 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5370#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:07,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {5370#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {5371#(<= main_~a~0 2)} assume true; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,688 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5371#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:07,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {5371#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {5372#(<= main_~a~0 3)} assume true; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,690 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5372#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:07,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {5372#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {5373#(<= main_~a~0 4)} assume true; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,692 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5373#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:07,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {5373#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {5374#(<= main_~a~0 5)} assume true; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,694 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5374#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:07,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~a~0 6)} assume true; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,696 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5375#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:07,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {5375#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5376#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:07,698 INFO L273 TraceCheckUtils]: 27: Hoare triple {5376#(<= main_~a~0 7)} assume true; {5376#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:07,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {5376#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {5368#false} havoc ~i~0;~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,699 INFO L273 TraceCheckUtils]: 32: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {5368#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 42: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 56: Hoare triple {5368#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5368#false} is VALID [2018-11-14 16:51:07,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 69: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 71: Hoare triple {5368#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 85: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 86: Hoare triple {5368#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 87: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 88: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 89: Hoare triple {5368#false} ~i~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,708 INFO L273 TraceCheckUtils]: 90: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 91: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 92: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 93: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 94: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 95: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,709 INFO L273 TraceCheckUtils]: 96: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 98: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {5368#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {5368#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 102: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,710 INFO L273 TraceCheckUtils]: 103: Hoare triple {5368#false} assume !(~i~0 < 100000); {5368#false} is VALID [2018-11-14 16:51:07,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {5368#false} havoc ~x~0;~x~0 := 0; {5368#false} is VALID [2018-11-14 16:51:07,711 INFO L273 TraceCheckUtils]: 105: Hoare triple {5368#false} assume true; {5368#false} is VALID [2018-11-14 16:51:07,711 INFO L273 TraceCheckUtils]: 106: Hoare triple {5368#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {5368#false} is VALID [2018-11-14 16:51:07,711 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-14 16:51:07,711 INFO L273 TraceCheckUtils]: 108: Hoare triple {5368#false} ~cond := #in~cond; {5368#false} is VALID [2018-11-14 16:51:07,711 INFO L273 TraceCheckUtils]: 109: Hoare triple {5368#false} assume ~cond == 0; {5368#false} is VALID [2018-11-14 16:51:07,711 INFO L273 TraceCheckUtils]: 110: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2018-11-14 16:51:07,722 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-14 16:51:07,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:07,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:51:07,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-11-14 16:51:07,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:07,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:51:07,813 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-14 16:51:07,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:51:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:51:07,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:51:07,814 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 11 states. [2018-11-14 16:51:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:08,079 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2018-11-14 16:51:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:51:08,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-11-14 16:51:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:51:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-14 16:51:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:51:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-14 16:51:08,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2018-11-14 16:51:08,355 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-14 16:51:08,360 INFO L225 Difference]: With dead ends: 207 [2018-11-14 16:51:08,360 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 16:51:08,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:51:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 16:51:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-14 16:51:08,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:08,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 119 states. [2018-11-14 16:51:08,407 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 119 states. [2018-11-14 16:51:08,407 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 119 states. [2018-11-14 16:51:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:08,409 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-14 16:51:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-14 16:51:08,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:08,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:08,410 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 120 states. [2018-11-14 16:51:08,410 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 120 states. [2018-11-14 16:51:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:08,412 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-14 16:51:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-14 16:51:08,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:08,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:08,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:08,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 16:51:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-11-14 16:51:08,416 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 111 [2018-11-14 16:51:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:08,416 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-11-14 16:51:08,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:51:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-14 16:51:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-14 16:51:08,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:08,417 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-14 16:51:08,418 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:08,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 568030828, now seen corresponding path program 8 times [2018-11-14 16:51:08,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:08,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:08,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:51:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:08,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {6386#true} call ULTIMATE.init(); {6386#true} is VALID [2018-11-14 16:51:08,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {6386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6386#true} is VALID [2018-11-14 16:51:08,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {6386#true} assume true; {6386#true} is VALID [2018-11-14 16:51:08,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6386#true} {6386#true} #126#return; {6386#true} is VALID [2018-11-14 16:51:08,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {6386#true} call #t~ret16 := main(); {6386#true} is VALID [2018-11-14 16:51:08,654 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-14 16:51:08,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {6388#(= main_~a~0 0)} assume true; {6388#(= main_~a~0 0)} is VALID [2018-11-14 16:51:08,654 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6388#(= main_~a~0 0)} is VALID [2018-11-14 16:51:08,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {6388#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {6389#(<= main_~a~0 1)} assume true; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,655 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {6389#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {6390#(<= main_~a~0 2)} assume true; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,657 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {6390#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {6391#(<= main_~a~0 3)} assume true; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,659 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {6391#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {6392#(<= main_~a~0 4)} assume true; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,661 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {6392#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {6393#(<= main_~a~0 5)} assume true; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,662 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {6393#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {6394#(<= main_~a~0 6)} assume true; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,664 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {6394#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {6395#(<= main_~a~0 7)} assume true; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,702 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6396#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:08,703 INFO L273 TraceCheckUtils]: 30: Hoare triple {6396#(<= main_~a~0 8)} assume true; {6396#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 31: Hoare triple {6396#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {6387#false} havoc ~i~0;~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 40: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 41: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 51: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 52: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 56: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,709 INFO L273 TraceCheckUtils]: 71: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 72: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 73: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 75: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 76: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 77: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 78: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 79: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,710 INFO L273 TraceCheckUtils]: 80: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 81: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 83: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 84: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 85: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 86: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,711 INFO L273 TraceCheckUtils]: 88: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 89: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 90: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 91: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 92: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 93: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 94: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 95: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 96: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,712 INFO L273 TraceCheckUtils]: 97: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 98: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 99: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 100: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 101: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 102: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 103: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 104: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,713 INFO L273 TraceCheckUtils]: 105: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 106: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 107: Hoare triple {6387#false} havoc ~x~0;~x~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 108: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 109: Hoare triple {6387#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {6387#false} is VALID [2018-11-14 16:51:08,714 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-14 16:51:08,714 INFO L273 TraceCheckUtils]: 111: Hoare triple {6387#false} ~cond := #in~cond; {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 112: Hoare triple {6387#false} assume ~cond == 0; {6387#false} is VALID [2018-11-14 16:51:08,714 INFO L273 TraceCheckUtils]: 113: Hoare triple {6387#false} assume !false; {6387#false} is VALID [2018-11-14 16:51:08,720 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-14 16:51:08,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:08,720 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-14 16:51:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:51:08,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:51:08,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:08,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:08,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {6386#true} call ULTIMATE.init(); {6386#true} is VALID [2018-11-14 16:51:08,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {6386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6386#true} is VALID [2018-11-14 16:51:08,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {6386#true} assume true; {6386#true} is VALID [2018-11-14 16:51:08,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6386#true} {6386#true} #126#return; {6386#true} is VALID [2018-11-14 16:51:08,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {6386#true} call #t~ret16 := main(); {6386#true} is VALID [2018-11-14 16:51:08,933 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-14 16:51:08,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {6415#(<= main_~a~0 0)} assume true; {6415#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:08,934 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6415#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:08,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {6415#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {6389#(<= main_~a~0 1)} assume true; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,935 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6389#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:08,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {6389#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {6390#(<= main_~a~0 2)} assume true; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,937 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6390#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:08,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {6390#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {6391#(<= main_~a~0 3)} assume true; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,957 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6391#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:08,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {6391#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {6392#(<= main_~a~0 4)} assume true; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,959 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6392#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:08,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {6392#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {6393#(<= main_~a~0 5)} assume true; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,960 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6393#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:08,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {6393#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {6394#(<= main_~a~0 6)} assume true; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,961 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6394#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:08,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {6394#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {6395#(<= main_~a~0 7)} assume true; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,962 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6395#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:08,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6396#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:08,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {6396#(<= main_~a~0 8)} assume true; {6396#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:08,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {6396#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {6387#false} havoc ~i~0;~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,966 INFO L273 TraceCheckUtils]: 37: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,966 INFO L273 TraceCheckUtils]: 38: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,967 INFO L273 TraceCheckUtils]: 41: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,967 INFO L273 TraceCheckUtils]: 42: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6387#false} is VALID [2018-11-14 16:51:08,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {6387#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6387#false} is VALID [2018-11-14 16:51:08,967 INFO L273 TraceCheckUtils]: 45: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,968 INFO L273 TraceCheckUtils]: 46: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,968 INFO L273 TraceCheckUtils]: 47: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,968 INFO L273 TraceCheckUtils]: 48: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 51: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 52: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 55: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 56: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,969 INFO L273 TraceCheckUtils]: 58: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 59: Hoare triple {6387#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 60: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 61: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 62: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 63: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 64: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 65: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,970 INFO L273 TraceCheckUtils]: 66: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 67: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 68: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 69: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 70: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 71: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 72: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 73: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6387#false} is VALID [2018-11-14 16:51:08,971 INFO L273 TraceCheckUtils]: 74: Hoare triple {6387#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 75: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 76: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 77: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 78: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 79: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 80: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 81: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 82: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,973 INFO L273 TraceCheckUtils]: 84: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,973 INFO L273 TraceCheckUtils]: 85: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,973 INFO L273 TraceCheckUtils]: 86: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,973 INFO L273 TraceCheckUtils]: 88: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 89: Hoare triple {6387#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 90: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 91: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 92: Hoare triple {6387#false} ~i~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 93: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,974 INFO L273 TraceCheckUtils]: 94: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 95: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 96: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 97: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 98: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 99: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,975 INFO L273 TraceCheckUtils]: 100: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 101: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 102: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 103: Hoare triple {6387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 104: Hoare triple {6387#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 105: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,976 INFO L273 TraceCheckUtils]: 106: Hoare triple {6387#false} assume !(~i~0 < 100000); {6387#false} is VALID [2018-11-14 16:51:08,977 INFO L273 TraceCheckUtils]: 107: Hoare triple {6387#false} havoc ~x~0;~x~0 := 0; {6387#false} is VALID [2018-11-14 16:51:08,977 INFO L273 TraceCheckUtils]: 108: Hoare triple {6387#false} assume true; {6387#false} is VALID [2018-11-14 16:51:08,977 INFO L273 TraceCheckUtils]: 109: Hoare triple {6387#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {6387#false} is VALID [2018-11-14 16:51:08,977 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-14 16:51:08,977 INFO L273 TraceCheckUtils]: 111: Hoare triple {6387#false} ~cond := #in~cond; {6387#false} is VALID [2018-11-14 16:51:08,977 INFO L273 TraceCheckUtils]: 112: Hoare triple {6387#false} assume ~cond == 0; {6387#false} is VALID [2018-11-14 16:51:08,978 INFO L273 TraceCheckUtils]: 113: Hoare triple {6387#false} assume !false; {6387#false} is VALID [2018-11-14 16:51:08,984 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-14 16:51:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:51:09,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-11-14 16:51:09,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:09,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:51:09,076 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-14 16:51:09,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:51:09,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:51:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:51:09,077 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 12 states. [2018-11-14 16:51:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:09,465 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-11-14 16:51:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:51:09,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2018-11-14 16:51:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:51:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-14 16:51:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:51:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-14 16:51:09,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-14 16:51:09,587 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-14 16:51:09,590 INFO L225 Difference]: With dead ends: 210 [2018-11-14 16:51:09,591 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 16:51:09,591 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-14 16:51:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 16:51:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 16:51:09,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:09,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:09,626 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:09,627 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 16:51:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:09,630 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-14 16:51:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-14 16:51:09,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:09,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:09,631 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 16:51:09,631 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 16:51:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:09,633 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-14 16:51:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-14 16:51:09,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:09,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:09,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:09,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:51:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-11-14 16:51:09,637 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 114 [2018-11-14 16:51:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:09,637 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-11-14 16:51:09,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:51:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-14 16:51:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:51:09,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:09,639 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-14 16:51:09,639 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:09,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2117937609, now seen corresponding path program 9 times [2018-11-14 16:51:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:09,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:10,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {7429#true} call ULTIMATE.init(); {7429#true} is VALID [2018-11-14 16:51:10,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {7429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7429#true} is VALID [2018-11-14 16:51:10,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:10,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7429#true} {7429#true} #126#return; {7429#true} is VALID [2018-11-14 16:51:10,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {7429#true} call #t~ret16 := main(); {7429#true} is VALID [2018-11-14 16:51:10,589 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-14 16:51:10,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {7431#(= main_~a~0 0)} assume true; {7431#(= main_~a~0 0)} is VALID [2018-11-14 16:51:10,590 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7431#(= main_~a~0 0)} is VALID [2018-11-14 16:51:10,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {7431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7432#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:10,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {7432#(<= main_~a~0 1)} assume true; {7432#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:10,591 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7432#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:10,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {7432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7433#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:10,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {7433#(<= main_~a~0 2)} assume true; {7433#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:10,592 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7433#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:10,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {7433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7434#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:10,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {7434#(<= main_~a~0 3)} assume true; {7434#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:10,593 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7434#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:10,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {7434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7435#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:10,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {7435#(<= main_~a~0 4)} assume true; {7435#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:10,595 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7435#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:10,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {7435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7436#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:10,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {7436#(<= main_~a~0 5)} assume true; {7436#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:10,597 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7436#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:10,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {7436#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7437#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:10,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {7437#(<= main_~a~0 6)} assume true; {7437#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:10,599 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7437#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:10,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {7437#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7438#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:10,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {7438#(<= main_~a~0 7)} assume true; {7438#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:10,601 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7438#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:10,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {7438#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7439#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:10,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {7439#(<= main_~a~0 8)} assume true; {7439#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:10,623 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7439#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:10,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {7439#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7440#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:10,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {7440#(<= main_~a~0 9)} assume true; {7440#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:10,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {7440#(<= main_~a~0 9)} assume !(~a~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {7430#false} havoc ~i~0;~i~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 44: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 45: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 47: Hoare triple {7430#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 53: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7430#false} is VALID [2018-11-14 16:51:10,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 57: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 58: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 59: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 62: Hoare triple {7430#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7430#false} is VALID [2018-11-14 16:51:10,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 64: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 65: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 66: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 67: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 68: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 69: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 70: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-14 16:51:10,628 INFO L273 TraceCheckUtils]: 71: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 72: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 73: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 74: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 75: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 76: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 77: Hoare triple {7430#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 78: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 79: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,629 INFO L273 TraceCheckUtils]: 80: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 81: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 82: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 83: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 84: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 85: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 86: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 87: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 88: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-14 16:51:10,630 INFO L273 TraceCheckUtils]: 89: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 90: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 91: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 92: Hoare triple {7430#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 93: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 94: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 95: Hoare triple {7430#false} ~i~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,631 INFO L273 TraceCheckUtils]: 96: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 97: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 98: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 99: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 100: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 101: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 102: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 103: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 104: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7430#false} is VALID [2018-11-14 16:51:10,632 INFO L273 TraceCheckUtils]: 105: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 106: Hoare triple {7430#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {7430#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 108: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 109: Hoare triple {7430#false} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 110: Hoare triple {7430#false} havoc ~x~0;~x~0 := 0; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 111: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:10,633 INFO L273 TraceCheckUtils]: 112: Hoare triple {7430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {7430#false} is VALID [2018-11-14 16:51:10,633 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-14 16:51:10,634 INFO L273 TraceCheckUtils]: 114: Hoare triple {7430#false} ~cond := #in~cond; {7430#false} is VALID [2018-11-14 16:51:10,634 INFO L273 TraceCheckUtils]: 115: Hoare triple {7430#false} assume ~cond == 0; {7430#false} is VALID [2018-11-14 16:51:10,634 INFO L273 TraceCheckUtils]: 116: Hoare triple {7430#false} assume !false; {7430#false} is VALID [2018-11-14 16:51:10,639 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-14 16:51:10,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:10,640 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-14 16:51:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:51:11,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:51:11,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:11,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:11,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {7429#true} call ULTIMATE.init(); {7429#true} is VALID [2018-11-14 16:51:11,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {7429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7429#true} is VALID [2018-11-14 16:51:11,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7429#true} {7429#true} #126#return; {7429#true} is VALID [2018-11-14 16:51:11,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {7429#true} call #t~ret16 := main(); {7429#true} is VALID [2018-11-14 16:51:11,372 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-14 16:51:11,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,373 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,373 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,374 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,374 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,375 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,375 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,375 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,376 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7429#true} is VALID [2018-11-14 16:51:11,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {7429#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7429#true} is VALID [2018-11-14 16:51:11,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,376 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {7537#(< main_~a~0 100000)} is VALID [2018-11-14 16:51:11,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {7537#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7541#(<= main_~a~0 100000)} is VALID [2018-11-14 16:51:11,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {7541#(<= main_~a~0 100000)} assume true; {7541#(<= main_~a~0 100000)} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {7541#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {7429#true} havoc ~i~0;~i~0 := 0; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-14 16:51:11,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 47: Hoare triple {7429#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 48: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-14 16:51:11,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 57: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 58: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-14 16:51:11,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 60: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 62: Hoare triple {7429#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 64: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 71: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 73: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 74: Hoare triple {7429#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7429#true} is VALID [2018-11-14 16:51:11,382 INFO L273 TraceCheckUtils]: 75: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {7674#(< main_~i~0 100000)} is VALID [2018-11-14 16:51:11,383 INFO L273 TraceCheckUtils]: 77: Hoare triple {7674#(< main_~i~0 100000)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {7678#(<= main_~i~0 100000)} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {7678#(<= main_~i~0 100000)} assume true; {7678#(<= main_~i~0 100000)} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {7678#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {7429#true} ~i~0 := 0; {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 81: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 82: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 86: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 87: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 90: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 91: Hoare triple {7429#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 92: Hoare triple {7429#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 93: Hoare triple {7429#true} assume true; {7429#true} is VALID [2018-11-14 16:51:11,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {7429#true} assume !(~i~0 < 100000); {7429#true} is VALID [2018-11-14 16:51:11,386 INFO L273 TraceCheckUtils]: 95: Hoare triple {7429#true} ~i~0 := 0; {7733#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:11,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {7733#(<= main_~i~0 0)} assume true; {7733#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:11,386 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 + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7733#(<= main_~i~0 0)} is VALID [2018-11-14 16:51:11,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {7733#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:11,387 INFO L273 TraceCheckUtils]: 99: Hoare triple {7743#(<= main_~i~0 1)} assume true; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:11,388 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 + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7743#(<= main_~i~0 1)} is VALID [2018-11-14 16:51:11,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {7743#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7753#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:11,388 INFO L273 TraceCheckUtils]: 102: Hoare triple {7753#(<= main_~i~0 2)} assume true; {7753#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:11,389 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 + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7753#(<= main_~i~0 2)} is VALID [2018-11-14 16:51:11,389 INFO L273 TraceCheckUtils]: 104: Hoare triple {7753#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7763#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:11,390 INFO L273 TraceCheckUtils]: 105: Hoare triple {7763#(<= main_~i~0 3)} assume true; {7763#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:11,390 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 + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {7763#(<= main_~i~0 3)} is VALID [2018-11-14 16:51:11,391 INFO L273 TraceCheckUtils]: 107: Hoare triple {7763#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {7773#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:11,391 INFO L273 TraceCheckUtils]: 108: Hoare triple {7773#(<= main_~i~0 4)} assume true; {7773#(<= main_~i~0 4)} is VALID [2018-11-14 16:51:11,392 INFO L273 TraceCheckUtils]: 109: Hoare triple {7773#(<= main_~i~0 4)} assume !(~i~0 < 100000); {7430#false} is VALID [2018-11-14 16:51:11,392 INFO L273 TraceCheckUtils]: 110: Hoare triple {7430#false} havoc ~x~0;~x~0 := 0; {7430#false} is VALID [2018-11-14 16:51:11,392 INFO L273 TraceCheckUtils]: 111: Hoare triple {7430#false} assume true; {7430#false} is VALID [2018-11-14 16:51:11,393 INFO L273 TraceCheckUtils]: 112: Hoare triple {7430#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {7430#false} is VALID [2018-11-14 16:51:11,393 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-14 16:51:11,393 INFO L273 TraceCheckUtils]: 114: Hoare triple {7430#false} ~cond := #in~cond; {7430#false} is VALID [2018-11-14 16:51:11,393 INFO L273 TraceCheckUtils]: 115: Hoare triple {7430#false} assume ~cond == 0; {7430#false} is VALID [2018-11-14 16:51:11,393 INFO L273 TraceCheckUtils]: 116: Hoare triple {7430#false} assume !false; {7430#false} is VALID [2018-11-14 16:51:11,399 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-14 16:51:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:11,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-14 16:51:11,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-11-14 16:51:11,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:11,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:51:11,519 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-14 16:51:11,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:51:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:51:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:51:11,521 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 21 states. [2018-11-14 16:51:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:13,449 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-11-14 16:51:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:51:13,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-11-14 16:51:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:51:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2018-11-14 16:51:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:51:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2018-11-14 16:51:13,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 213 transitions. [2018-11-14 16:51:14,019 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-14 16:51:14,022 INFO L225 Difference]: With dead ends: 245 [2018-11-14 16:51:14,022 INFO L226 Difference]: Without dead ends: 158 [2018-11-14 16:51:14,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:51:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-14 16:51:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-11-14 16:51:14,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:14,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2018-11-14 16:51:14,106 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-14 16:51:14,106 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-14 16:51:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:14,111 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-11-14 16:51:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-14 16:51:14,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:14,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:14,112 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-14 16:51:14,112 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-14 16:51:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:14,116 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-11-14 16:51:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-14 16:51:14,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:14,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:14,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:14,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 16:51:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2018-11-14 16:51:14,120 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 117 [2018-11-14 16:51:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:14,121 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2018-11-14 16:51:14,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:51:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2018-11-14 16:51:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-14 16:51:14,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:14,123 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-14 16:51:14,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:14,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1833649879, now seen corresponding path program 10 times [2018-11-14 16:51:14,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:14,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:14,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:14,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2018-11-14 16:51:14,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {8676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8676#true} is VALID [2018-11-14 16:51:14,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2018-11-14 16:51:14,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #126#return; {8676#true} is VALID [2018-11-14 16:51:14,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret16 := main(); {8676#true} is VALID [2018-11-14 16:51:14,887 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-14 16:51:14,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {8678#(= main_~a~0 0)} assume true; {8678#(= main_~a~0 0)} is VALID [2018-11-14 16:51:14,888 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8678#(= main_~a~0 0)} is VALID [2018-11-14 16:51:14,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {8678#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:14,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {8679#(<= main_~a~0 1)} assume true; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:14,890 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:14,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {8679#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:14,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {8680#(<= main_~a~0 2)} assume true; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:14,893 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:14,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {8680#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:14,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {8681#(<= main_~a~0 3)} assume true; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:14,895 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:14,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {8681#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:14,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {8682#(<= main_~a~0 4)} assume true; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:14,897 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:14,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {8682#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:14,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {8683#(<= main_~a~0 5)} assume true; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:14,899 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:14,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {8683#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:14,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {8684#(<= main_~a~0 6)} assume true; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:14,901 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:14,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {8684#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:14,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {8685#(<= main_~a~0 7)} assume true; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:14,903 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:14,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {8685#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:14,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {8686#(<= main_~a~0 8)} assume true; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:14,905 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:14,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {8686#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:14,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {8687#(<= main_~a~0 9)} assume true; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:14,908 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:14,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {8687#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:14,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {8688#(<= main_~a~0 10)} assume true; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:14,923 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:14,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {8688#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8689#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:14,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {8689#(<= main_~a~0 11)} assume true; {8689#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:14,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {8689#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {8677#false} havoc ~i~0;~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 42: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 44: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 50: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 51: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,926 INFO L273 TraceCheckUtils]: 54: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,927 INFO L273 TraceCheckUtils]: 55: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,927 INFO L273 TraceCheckUtils]: 56: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,927 INFO L273 TraceCheckUtils]: 57: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,927 INFO L273 TraceCheckUtils]: 58: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:14,927 INFO L273 TraceCheckUtils]: 59: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:14,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,928 INFO L273 TraceCheckUtils]: 62: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,928 INFO L273 TraceCheckUtils]: 63: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,928 INFO L273 TraceCheckUtils]: 64: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 65: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 66: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 67: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,929 INFO L273 TraceCheckUtils]: 71: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 73: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 74: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 75: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 77: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 79: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,931 INFO L273 TraceCheckUtils]: 85: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 86: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 87: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 88: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 90: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 91: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,932 INFO L273 TraceCheckUtils]: 92: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 93: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 94: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 95: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 96: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 97: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,933 INFO L273 TraceCheckUtils]: 98: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 99: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 100: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 101: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 102: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 103: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 104: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,934 INFO L273 TraceCheckUtils]: 105: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 106: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 107: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 108: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 109: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 110: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 111: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,935 INFO L273 TraceCheckUtils]: 112: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 113: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 114: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 115: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 116: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 117: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 120: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 121: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 122: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 126: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 127: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 128: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 129: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 130: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,938 INFO L273 TraceCheckUtils]: 131: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 132: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 133: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 134: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 135: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 136: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 137: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,939 INFO L273 TraceCheckUtils]: 138: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 139: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 140: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 141: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 142: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 143: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 144: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,940 INFO L273 TraceCheckUtils]: 145: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:14,941 INFO L273 TraceCheckUtils]: 146: Hoare triple {8677#false} havoc ~x~0;~x~0 := 0; {8677#false} is VALID [2018-11-14 16:51:14,941 INFO L273 TraceCheckUtils]: 147: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:14,941 INFO L273 TraceCheckUtils]: 148: Hoare triple {8677#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {8677#false} is VALID [2018-11-14 16:51:14,941 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-14 16:51:14,941 INFO L273 TraceCheckUtils]: 150: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2018-11-14 16:51:14,941 INFO L273 TraceCheckUtils]: 151: Hoare triple {8677#false} assume ~cond == 0; {8677#false} is VALID [2018-11-14 16:51:14,941 INFO L273 TraceCheckUtils]: 152: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2018-11-14 16:51:14,962 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-14 16:51:14,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:14,962 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-14 16:51:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:51:15,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:51:15,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:51:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:15,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:51:15,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2018-11-14 16:51:15,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {8676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8676#true} is VALID [2018-11-14 16:51:15,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2018-11-14 16:51:15,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #126#return; {8676#true} is VALID [2018-11-14 16:51:15,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret16 := main(); {8676#true} is VALID [2018-11-14 16:51:15,412 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-14 16:51:15,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {8708#(<= main_~a~0 0)} assume true; {8708#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:15,413 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8708#(<= main_~a~0 0)} is VALID [2018-11-14 16:51:15,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {8708#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:15,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {8679#(<= main_~a~0 1)} assume true; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:15,414 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8679#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:15,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {8679#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:15,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {8680#(<= main_~a~0 2)} assume true; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:15,416 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8680#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:15,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {8680#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:15,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {8681#(<= main_~a~0 3)} assume true; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:15,418 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8681#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:15,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {8681#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:15,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {8682#(<= main_~a~0 4)} assume true; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:15,420 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8682#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:15,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {8682#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:15,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {8683#(<= main_~a~0 5)} assume true; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:15,422 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8683#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:15,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {8683#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:15,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {8684#(<= main_~a~0 6)} assume true; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:15,424 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8684#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:15,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {8684#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:15,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {8685#(<= main_~a~0 7)} assume true; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:15,426 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8685#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:15,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {8685#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:15,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {8686#(<= main_~a~0 8)} assume true; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:15,427 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8686#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:15,428 INFO L273 TraceCheckUtils]: 32: Hoare triple {8686#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:15,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {8687#(<= main_~a~0 9)} assume true; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:15,429 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8687#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:15,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {8687#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:15,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {8688#(<= main_~a~0 10)} assume true; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:15,431 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8688#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:15,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {8688#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8689#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:15,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {8689#(<= main_~a~0 11)} assume true; {8689#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:15,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {8689#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,433 INFO L273 TraceCheckUtils]: 41: Hoare triple {8677#false} havoc ~i~0;~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,434 INFO L273 TraceCheckUtils]: 43: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,434 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,435 INFO L273 TraceCheckUtils]: 48: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,435 INFO L273 TraceCheckUtils]: 50: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 56: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 57: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8677#false} is VALID [2018-11-14 16:51:15,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {8677#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 64: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 65: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 66: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 67: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,437 INFO L273 TraceCheckUtils]: 68: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 69: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 71: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 72: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 73: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 74: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 75: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 77: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 78: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 79: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 80: Hoare triple {8677#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 83: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,439 INFO L273 TraceCheckUtils]: 85: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 86: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 87: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 89: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 90: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 91: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 92: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 93: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,440 INFO L273 TraceCheckUtils]: 94: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 95: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 96: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 98: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 99: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 100: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 101: Hoare triple {8677#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 102: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,441 INFO L273 TraceCheckUtils]: 103: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 104: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 105: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 106: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 107: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 108: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 109: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 110: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,442 INFO L273 TraceCheckUtils]: 111: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 112: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 113: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 114: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 115: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 116: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 117: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 118: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 119: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,443 INFO L273 TraceCheckUtils]: 120: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 121: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 122: Hoare triple {8677#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 123: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 124: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 125: Hoare triple {8677#false} ~i~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 126: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 127: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 128: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,444 INFO L273 TraceCheckUtils]: 129: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 130: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 131: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 132: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 133: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 134: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 135: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 136: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,445 INFO L273 TraceCheckUtils]: 137: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 138: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 139: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 140: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 141: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 142: Hoare triple {8677#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 143: Hoare triple {8677#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 144: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 145: Hoare triple {8677#false} assume !(~i~0 < 100000); {8677#false} is VALID [2018-11-14 16:51:15,446 INFO L273 TraceCheckUtils]: 146: Hoare triple {8677#false} havoc ~x~0;~x~0 := 0; {8677#false} is VALID [2018-11-14 16:51:15,447 INFO L273 TraceCheckUtils]: 147: Hoare triple {8677#false} assume true; {8677#false} is VALID [2018-11-14 16:51:15,447 INFO L273 TraceCheckUtils]: 148: Hoare triple {8677#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {8677#false} is VALID [2018-11-14 16:51:15,447 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-14 16:51:15,447 INFO L273 TraceCheckUtils]: 150: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2018-11-14 16:51:15,447 INFO L273 TraceCheckUtils]: 151: Hoare triple {8677#false} assume ~cond == 0; {8677#false} is VALID [2018-11-14 16:51:15,447 INFO L273 TraceCheckUtils]: 152: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2018-11-14 16:51:15,458 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-14 16:51:15,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:51:15,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:51:15,480 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-11-14 16:51:15,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:51:15,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:51:15,556 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-14 16:51:15,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:51:15,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:51:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:51:15,558 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 15 states. [2018-11-14 16:51:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:16,927 INFO L93 Difference]: Finished difference Result 279 states and 291 transitions. [2018-11-14 16:51:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:51:16,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-11-14 16:51:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:51:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:51:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2018-11-14 16:51:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:51:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2018-11-14 16:51:16,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 121 transitions. [2018-11-14 16:51:17,507 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-14 16:51:17,510 INFO L225 Difference]: With dead ends: 279 [2018-11-14 16:51:17,511 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 16:51:17,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:51:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 16:51:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-14 16:51:17,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:51:17,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-14 16:51:17,673 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-14 16:51:17,673 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-14 16:51:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:17,677 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-14 16:51:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-14 16:51:17,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:17,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:17,678 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-14 16:51:17,678 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-14 16:51:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:51:17,682 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-14 16:51:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-14 16:51:17,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:51:17,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:51:17,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:51:17,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:51:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-14 16:51:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 167 transitions. [2018-11-14 16:51:17,686 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 167 transitions. Word has length 153 [2018-11-14 16:51:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:51:17,687 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 167 transitions. [2018-11-14 16:51:17,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:51:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 167 transitions. [2018-11-14 16:51:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-14 16:51:17,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:51:17,689 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-14 16:51:17,689 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:51:17,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:51:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1870649556, now seen corresponding path program 11 times [2018-11-14 16:51:17,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:51:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:51:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:17,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:51:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:51:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:51:18,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {10061#true} call ULTIMATE.init(); {10061#true} is VALID [2018-11-14 16:51:18,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {10061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10061#true} is VALID [2018-11-14 16:51:18,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {10061#true} assume true; {10061#true} is VALID [2018-11-14 16:51:18,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10061#true} {10061#true} #126#return; {10061#true} is VALID [2018-11-14 16:51:18,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {10061#true} call #t~ret16 := main(); {10061#true} is VALID [2018-11-14 16:51:18,481 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-14 16:51:18,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {10063#(= main_~a~0 0)} assume true; {10063#(= main_~a~0 0)} is VALID [2018-11-14 16:51:18,483 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10063#(= main_~a~0 0)} is VALID [2018-11-14 16:51:18,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {10063#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10064#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:18,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {10064#(<= main_~a~0 1)} assume true; {10064#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:18,484 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10064#(<= main_~a~0 1)} is VALID [2018-11-14 16:51:18,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {10064#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10065#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:18,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {10065#(<= main_~a~0 2)} assume true; {10065#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:18,486 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10065#(<= main_~a~0 2)} is VALID [2018-11-14 16:51:18,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {10065#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10066#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:18,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {10066#(<= main_~a~0 3)} assume true; {10066#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:18,488 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10066#(<= main_~a~0 3)} is VALID [2018-11-14 16:51:18,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {10066#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10067#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:18,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {10067#(<= main_~a~0 4)} assume true; {10067#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:18,490 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10067#(<= main_~a~0 4)} is VALID [2018-11-14 16:51:18,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {10067#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10068#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:18,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {10068#(<= main_~a~0 5)} assume true; {10068#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:18,492 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10068#(<= main_~a~0 5)} is VALID [2018-11-14 16:51:18,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {10068#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10069#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:18,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {10069#(<= main_~a~0 6)} assume true; {10069#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:18,493 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10069#(<= main_~a~0 6)} is VALID [2018-11-14 16:51:18,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {10069#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10070#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:18,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {10070#(<= main_~a~0 7)} assume true; {10070#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:18,495 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10070#(<= main_~a~0 7)} is VALID [2018-11-14 16:51:18,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {10070#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10071#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:18,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {10071#(<= main_~a~0 8)} assume true; {10071#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:18,497 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10071#(<= main_~a~0 8)} is VALID [2018-11-14 16:51:18,498 INFO L273 TraceCheckUtils]: 32: Hoare triple {10071#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10072#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:18,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {10072#(<= main_~a~0 9)} assume true; {10072#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:18,499 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10072#(<= main_~a~0 9)} is VALID [2018-11-14 16:51:18,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {10072#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10073#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:18,500 INFO L273 TraceCheckUtils]: 36: Hoare triple {10073#(<= main_~a~0 10)} assume true; {10073#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:18,501 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10073#(<= main_~a~0 10)} is VALID [2018-11-14 16:51:18,501 INFO L273 TraceCheckUtils]: 38: Hoare triple {10073#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10074#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:18,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {10074#(<= main_~a~0 11)} assume true; {10074#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:18,503 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 + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a5~0.base, ~#a5~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10074#(<= main_~a~0 11)} is VALID [2018-11-14 16:51:18,503 INFO L273 TraceCheckUtils]: 41: Hoare triple {10074#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10075#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:18,504 INFO L273 TraceCheckUtils]: 42: Hoare triple {10075#(<= main_~a~0 12)} assume true; {10075#(<= main_~a~0 12)} is VALID [2018-11-14 16:51:18,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {10075#(<= main_~a~0 12)} assume !(~a~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {10062#false} havoc ~i~0;~i~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,505 INFO L273 TraceCheckUtils]: 45: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,506 INFO L273 TraceCheckUtils]: 51: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,507 INFO L273 TraceCheckUtils]: 55: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {10062#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 63: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 64: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,508 INFO L273 TraceCheckUtils]: 65: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 66: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 67: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 68: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 69: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 70: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 71: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 72: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 73: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,509 INFO L273 TraceCheckUtils]: 74: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 75: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 76: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 77: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 78: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 79: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 80: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 81: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,510 INFO L273 TraceCheckUtils]: 82: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 83: Hoare triple {10062#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 84: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 85: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 86: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 87: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 88: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 89: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 90: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,511 INFO L273 TraceCheckUtils]: 91: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 92: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 93: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 94: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 95: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 96: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 97: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 98: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,512 INFO L273 TraceCheckUtils]: 99: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 100: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 101: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 102: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 103: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 104: Hoare triple {10062#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 105: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 106: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 107: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,513 INFO L273 TraceCheckUtils]: 108: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 109: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 110: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 111: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 112: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 113: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 114: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 115: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 116: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,514 INFO L273 TraceCheckUtils]: 117: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 118: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 119: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 120: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 121: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 122: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 123: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 124: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10062#false} is VALID [2018-11-14 16:51:18,515 INFO L273 TraceCheckUtils]: 125: Hoare triple {10062#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 126: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 127: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 128: Hoare triple {10062#false} ~i~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 129: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 130: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 131: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,516 INFO L273 TraceCheckUtils]: 132: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 133: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 134: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 135: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 136: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 137: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,517 INFO L273 TraceCheckUtils]: 138: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,518 INFO L273 TraceCheckUtils]: 139: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,518 INFO L273 TraceCheckUtils]: 140: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,518 INFO L273 TraceCheckUtils]: 141: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,518 INFO L273 TraceCheckUtils]: 142: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,518 INFO L273 TraceCheckUtils]: 143: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 144: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 145: Hoare triple {10062#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 146: Hoare triple {10062#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 147: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 148: Hoare triple {10062#false} assume !(~i~0 < 100000); {10062#false} is VALID [2018-11-14 16:51:18,519 INFO L273 TraceCheckUtils]: 149: Hoare triple {10062#false} havoc ~x~0;~x~0 := 0; {10062#false} is VALID [2018-11-14 16:51:18,520 INFO L273 TraceCheckUtils]: 150: Hoare triple {10062#false} assume true; {10062#false} is VALID [2018-11-14 16:51:18,520 INFO L273 TraceCheckUtils]: 151: Hoare triple {10062#false} assume !!(~x~0 < 100000);call #t~mem14 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem15 := read~int(~#a6~0.base, ~#a6~0.offset + ~x~0 * 4, 4); {10062#false} is VALID [2018-11-14 16:51:18,520 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-14 16:51:18,520 INFO L273 TraceCheckUtils]: 153: Hoare triple {10062#false} ~cond := #in~cond; {10062#false} is VALID [2018-11-14 16:51:18,520 INFO L273 TraceCheckUtils]: 154: Hoare triple {10062#false} assume ~cond == 0; {10062#false} is VALID [2018-11-14 16:51:18,520 INFO L273 TraceCheckUtils]: 155: Hoare triple {10062#false} assume !false; {10062#false} is VALID [2018-11-14 16:51:18,533 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-14 16:51:18,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:51:18,534 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-14 16:51:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1