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_copy3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:43:12,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:43:12,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:43:12,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:43:12,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:43:12,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:43:12,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:43:12,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:43:12,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:43:12,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:43:12,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:43:12,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:43:12,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:43:12,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:43:12,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:43:12,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:43:12,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:43:12,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:43:12,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:43:12,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:43:12,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:43:12,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:43:12,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:43:12,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:43:12,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:43:12,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:43:12,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:43:12,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:43:12,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:43:12,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:43:12,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:43:12,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:43:12,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:43:12,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:43:12,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:43:12,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:43:12,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:43:12,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:43:12,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:43:12,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:43:12,955 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:43:12,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:43:12,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:43:12,956 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:43:12,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:43:12,957 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:43:12,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:43:12,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:43:12,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:43:12,958 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:43:12,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:43:12,958 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:43:12,959 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:43:12,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:43:12,959 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:43:12,959 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:43:12,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:43:12,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:43:12,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:43:12,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:43:12,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:12,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:43:12,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:43:12,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:43:12,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:43:12,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:43:12,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:43:12,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:43:13,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:43:13,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:43:13,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:43:13,059 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:43:13,060 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:43:13,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-18 22:43:13,117 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243e972e0/cb1bda3d95dc4cd79821d141db685ece/FLAG355be9387 [2018-11-18 22:43:13,604 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:43:13,607 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-18 22:43:13,615 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243e972e0/cb1bda3d95dc4cd79821d141db685ece/FLAG355be9387 [2018-11-18 22:43:13,909 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243e972e0/cb1bda3d95dc4cd79821d141db685ece [2018-11-18 22:43:13,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:43:13,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:43:13,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:13,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:43:13,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:43:13,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:13" (1/1) ... [2018-11-18 22:43:13,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b02c97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:13, skipping insertion in model container [2018-11-18 22:43:13,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:13" (1/1) ... [2018-11-18 22:43:13,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:43:13,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:43:14,245 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,250 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:43:14,292 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,318 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:43:14,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14 WrapperNode [2018-11-18 22:43:14,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:43:14,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:43:14,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:43:14,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:43:14,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:43:14,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:43:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:43:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:43:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:43:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:43:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:43:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:43:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:43:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:43:15,354 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:43:15,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15 BoogieIcfgContainer [2018-11-18 22:43:15,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:43:15,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:43:15,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:43:15,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:43:15,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:43:13" (1/3) ... [2018-11-18 22:43:15,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755d9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (2/3) ... [2018-11-18 22:43:15,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755d9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15" (3/3) ... [2018-11-18 22:43:15,364 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy3_false-unreach-call_ground.i [2018-11-18 22:43:15,375 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:43:15,385 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:43:15,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:43:15,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:43:15,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:43:15,437 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:43:15,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:43:15,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:43:15,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:43:15,438 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:43:15,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:43:15,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:43:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 22:43:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:43:15,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:15,467 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] [2018-11-18 22:43:15,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:15,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1484499557, now seen corresponding path program 1 times [2018-11-18 22:43:15,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:15,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:15,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:15,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-18 22:43:15,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-18 22:43:15,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 22:43:15,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #96#return; {41#true} is VALID [2018-11-18 22:43:15,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret12 := main(); {41#true} is VALID [2018-11-18 22:43:15,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#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);havoc ~a~0;~a~0 := 0; {41#true} is VALID [2018-11-18 22:43:15,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-18 22:43:15,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} havoc ~i~0;~i~0 := 0; {42#false} is VALID [2018-11-18 22:43:15,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-18 22:43:15,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2018-11-18 22:43:15,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-18 22:43:15,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2018-11-18 22:43:15,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-18 22:43:15,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} havoc ~x~0;~x~0 := 0; {42#false} is VALID [2018-11-18 22:43:15,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-18 22:43:15,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {42#false} is VALID [2018-11-18 22:43:15,699 INFO L256 TraceCheckUtils]: 16: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {42#false} is VALID [2018-11-18 22:43:15,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-18 22:43:15,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2018-11-18 22:43:15,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-18 22:43:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:43:15,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:43:15,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:15,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:43:15,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:15,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:43:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:43:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:15,837 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 22:43:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,078 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-18 22:43:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:43:16,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 22:43:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-18 22:43:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-18 22:43:16,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2018-11-18 22:43:16,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:16,400 INFO L225 Difference]: With dead ends: 67 [2018-11-18 22:43:16,400 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 22:43:16,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 22:43:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 22:43:16,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:16,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-18 22:43:16,462 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-18 22:43:16,463 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-18 22:43:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,468 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-18 22:43:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 22:43:16,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,470 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-18 22:43:16,470 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-18 22:43:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,475 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-18 22:43:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 22:43:16,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:16,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:43:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 22:43:16,481 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-18 22:43:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:16,482 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 22:43:16,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:43:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 22:43:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:43:16,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:16,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:16,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:16,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -593652933, now seen corresponding path program 1 times [2018-11-18 22:43:16,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:16,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2018-11-18 22:43:16,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {239#true} is VALID [2018-11-18 22:43:16,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2018-11-18 22:43:16,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #96#return; {239#true} is VALID [2018-11-18 22:43:16,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret12 := main(); {239#true} is VALID [2018-11-18 22:43:16,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#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);havoc ~a~0;~a~0 := 0; {241#(= main_~a~0 0)} is VALID [2018-11-18 22:43:16,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {241#(= main_~a~0 0)} assume true; {241#(= main_~a~0 0)} is VALID [2018-11-18 22:43:16,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(= main_~a~0 0)} assume !(~a~0 < 100000); {240#false} is VALID [2018-11-18 22:43:16,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#false} havoc ~i~0;~i~0 := 0; {240#false} is VALID [2018-11-18 22:43:16,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {240#false} assume true; {240#false} is VALID [2018-11-18 22:43:16,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {240#false} assume !(~i~0 < 100000); {240#false} is VALID [2018-11-18 22:43:16,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {240#false} ~i~0 := 0; {240#false} is VALID [2018-11-18 22:43:16,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {240#false} assume true; {240#false} is VALID [2018-11-18 22:43:16,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {240#false} assume !(~i~0 < 100000); {240#false} is VALID [2018-11-18 22:43:16,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {240#false} ~i~0 := 0; {240#false} is VALID [2018-11-18 22:43:16,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {240#false} assume true; {240#false} is VALID [2018-11-18 22:43:16,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {240#false} assume !(~i~0 < 100000); {240#false} is VALID [2018-11-18 22:43:16,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {240#false} havoc ~x~0;~x~0 := 0; {240#false} is VALID [2018-11-18 22:43:16,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {240#false} assume true; {240#false} is VALID [2018-11-18 22:43:16,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {240#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {240#false} is VALID [2018-11-18 22:43:16,647 INFO L256 TraceCheckUtils]: 20: Hoare triple {240#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {240#false} is VALID [2018-11-18 22:43:16,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2018-11-18 22:43:16,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2018-11-18 22:43:16,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {240#false} assume !false; {240#false} is VALID [2018-11-18 22:43:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:16,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:16,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:16,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:43:16,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:16,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:16,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:16,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:16,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:16,809 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-18 22:43:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,185 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-18 22:43:17,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:17,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 22:43:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:43:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:43:17,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-18 22:43:17,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,422 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:43:17,422 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 22:43:17,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 22:43:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-18 22:43:17,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:17,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-18 22:43:17,443 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-18 22:43:17,444 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-18 22:43:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,447 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 22:43:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-18 22:43:17,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,448 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-18 22:43:17,448 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-18 22:43:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,451 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 22:43:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-18 22:43:17,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:17,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:43:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-18 22:43:17,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-11-18 22:43:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:17,456 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-18 22:43:17,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 22:43:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:43:17,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:17,458 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] [2018-11-18 22:43:17,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:17,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1169841956, now seen corresponding path program 1 times [2018-11-18 22:43:17,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-18 22:43:17,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {441#true} is VALID [2018-11-18 22:43:17,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-18 22:43:17,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #96#return; {441#true} is VALID [2018-11-18 22:43:17,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret12 := main(); {441#true} is VALID [2018-11-18 22:43:17,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#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);havoc ~a~0;~a~0 := 0; {441#true} is VALID [2018-11-18 22:43:17,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-18 22:43:17,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {441#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {441#true} is VALID [2018-11-18 22:43:17,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {441#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {441#true} is VALID [2018-11-18 22:43:17,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-18 22:43:17,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {441#true} assume !(~a~0 < 100000); {441#true} is VALID [2018-11-18 22:43:17,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {441#true} havoc ~i~0;~i~0 := 0; {443#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {443#(= main_~i~0 0)} assume true; {443#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#(= main_~i~0 0)} assume !(~i~0 < 100000); {442#false} is VALID [2018-11-18 22:43:17,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} ~i~0 := 0; {442#false} is VALID [2018-11-18 22:43:17,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume true; {442#false} is VALID [2018-11-18 22:43:17,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} assume !(~i~0 < 100000); {442#false} is VALID [2018-11-18 22:43:17,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} ~i~0 := 0; {442#false} is VALID [2018-11-18 22:43:17,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume true; {442#false} is VALID [2018-11-18 22:43:17,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {442#false} assume !(~i~0 < 100000); {442#false} is VALID [2018-11-18 22:43:17,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {442#false} havoc ~x~0;~x~0 := 0; {442#false} is VALID [2018-11-18 22:43:17,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {442#false} assume true; {442#false} is VALID [2018-11-18 22:43:17,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {442#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {442#false} is VALID [2018-11-18 22:43:17,594 INFO L256 TraceCheckUtils]: 23: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {442#false} is VALID [2018-11-18 22:43:17,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-18 22:43:17,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {442#false} assume 0 == ~cond; {442#false} is VALID [2018-11-18 22:43:17,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-18 22:43:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:17,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:17,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:17,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 22:43:17,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:17,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:17,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:17,645 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-11-18 22:43:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,855 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-18 22:43:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:17,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 22:43:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-18 22:43:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-18 22:43:17,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2018-11-18 22:43:18,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,101 INFO L225 Difference]: With dead ends: 64 [2018-11-18 22:43:18,102 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:43:18,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:43:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-18 22:43:18,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:18,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2018-11-18 22:43:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2018-11-18 22:43:18,134 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2018-11-18 22:43:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,137 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 22:43:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-18 22:43:18,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,138 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2018-11-18 22:43:18,138 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2018-11-18 22:43:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,142 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 22:43:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-18 22:43:18,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:18,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:43:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-18 22:43:18,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-11-18 22:43:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:18,146 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-18 22:43:18,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 22:43:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 22:43:18,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:18,148 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 22:43:18,148 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1716524683, now seen corresponding path program 1 times [2018-11-18 22:43:18,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2018-11-18 22:43:18,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {674#true} is VALID [2018-11-18 22:43:18,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-18 22:43:18,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #96#return; {674#true} is VALID [2018-11-18 22:43:18,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret12 := main(); {674#true} is VALID [2018-11-18 22:43:18,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {674#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);havoc ~a~0;~a~0 := 0; {676#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {676#(= main_~a~0 0)} assume true; {676#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {676#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {676#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {676#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {677#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {677#(<= main_~a~0 1)} assume true; {677#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(<= main_~a~0 1)} assume !(~a~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {675#false} havoc ~i~0;~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {675#false} is VALID [2018-11-18 22:43:18,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {675#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {675#false} is VALID [2018-11-18 22:43:18,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {675#false} is VALID [2018-11-18 22:43:18,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {675#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {675#false} is VALID [2018-11-18 22:43:18,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {675#false} is VALID [2018-11-18 22:43:18,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {675#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {675#false} is VALID [2018-11-18 22:43:18,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {675#false} havoc ~x~0;~x~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {675#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {675#false} is VALID [2018-11-18 22:43:18,298 INFO L256 TraceCheckUtils]: 32: Hoare triple {675#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {675#false} is VALID [2018-11-18 22:43:18,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2018-11-18 22:43:18,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2018-11-18 22:43:18,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {675#false} assume !false; {675#false} is VALID [2018-11-18 22:43:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:43:18,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:18,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:18,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2018-11-18 22:43:18,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {674#true} is VALID [2018-11-18 22:43:18,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-18 22:43:18,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #96#return; {674#true} is VALID [2018-11-18 22:43:18,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret12 := main(); {674#true} is VALID [2018-11-18 22:43:18,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {674#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);havoc ~a~0;~a~0 := 0; {696#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= main_~a~0 0)} assume true; {696#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {696#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {696#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {677#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {677#(<= main_~a~0 1)} assume true; {677#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(<= main_~a~0 1)} assume !(~a~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {675#false} havoc ~i~0;~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {675#false} is VALID [2018-11-18 22:43:18,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {675#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {675#false} is VALID [2018-11-18 22:43:18,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {675#false} is VALID [2018-11-18 22:43:18,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {675#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {675#false} is VALID [2018-11-18 22:43:18,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,654 INFO L273 TraceCheckUtils]: 25: Hoare triple {675#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {675#false} is VALID [2018-11-18 22:43:18,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {675#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {675#false} is VALID [2018-11-18 22:43:18,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {675#false} assume !(~i~0 < 100000); {675#false} is VALID [2018-11-18 22:43:18,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {675#false} havoc ~x~0;~x~0 := 0; {675#false} is VALID [2018-11-18 22:43:18,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {675#false} assume true; {675#false} is VALID [2018-11-18 22:43:18,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {675#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {675#false} is VALID [2018-11-18 22:43:18,656 INFO L256 TraceCheckUtils]: 32: Hoare triple {675#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {675#false} is VALID [2018-11-18 22:43:18,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2018-11-18 22:43:18,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2018-11-18 22:43:18,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {675#false} assume !false; {675#false} is VALID [2018-11-18 22:43:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:43:18,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:18,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:43:18,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-18 22:43:18,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:18,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:43:18,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:43:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:43:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:18,820 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-18 22:43:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,078 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-18 22:43:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:43:19,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-18 22:43:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-18 22:43:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-18 22:43:19,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-18 22:43:19,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:19,286 INFO L225 Difference]: With dead ends: 75 [2018-11-18 22:43:19,286 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 22:43:19,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 22:43:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-18 22:43:19,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:19,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-18 22:43:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-18 22:43:19,324 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-18 22:43:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,327 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-18 22:43:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 22:43:19,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,328 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-18 22:43:19,329 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-18 22:43:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,332 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-18 22:43:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-18 22:43:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:43:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-18 22:43:19,336 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 36 [2018-11-18 22:43:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:19,336 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-18 22:43:19,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:43:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-18 22:43:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:43:19,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:19,338 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 22:43:19,338 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:19,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash -485257834, now seen corresponding path program 2 times [2018-11-18 22:43:19,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:19,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:19,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:19,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1036#true} is VALID [2018-11-18 22:43:19,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {1036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1036#true} is VALID [2018-11-18 22:43:19,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2018-11-18 22:43:19,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #96#return; {1036#true} is VALID [2018-11-18 22:43:19,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret12 := main(); {1036#true} is VALID [2018-11-18 22:43:19,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {1036#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);havoc ~a~0;~a~0 := 0; {1038#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {1038#(= main_~a~0 0)} assume true; {1038#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {1038#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1038#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {1038#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {1039#(<= main_~a~0 1)} assume true; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {1039#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {1039#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1040#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {1040#(<= main_~a~0 2)} assume true; {1040#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {1040#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {1037#false} havoc ~i~0;~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1037#false} is VALID [2018-11-18 22:43:19,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {1037#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1037#false} is VALID [2018-11-18 22:43:19,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1037#false} is VALID [2018-11-18 22:43:19,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {1037#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1037#false} is VALID [2018-11-18 22:43:19,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1037#false} is VALID [2018-11-18 22:43:19,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2018-11-18 22:43:19,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {1037#false} havoc ~x~0;~x~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {1037#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1037#false} is VALID [2018-11-18 22:43:19,611 INFO L256 TraceCheckUtils]: 35: Hoare triple {1037#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1037#false} is VALID [2018-11-18 22:43:19,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {1037#false} ~cond := #in~cond; {1037#false} is VALID [2018-11-18 22:43:19,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {1037#false} assume 0 == ~cond; {1037#false} is VALID [2018-11-18 22:43:19,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2018-11-18 22:43:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:43:19,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:19,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:19,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:19,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:19,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {1036#true} call ULTIMATE.init(); {1036#true} is VALID [2018-11-18 22:43:19,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {1036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1036#true} is VALID [2018-11-18 22:43:19,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {1036#true} assume true; {1036#true} is VALID [2018-11-18 22:43:19,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1036#true} {1036#true} #96#return; {1036#true} is VALID [2018-11-18 22:43:19,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {1036#true} call #t~ret12 := main(); {1036#true} is VALID [2018-11-18 22:43:19,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {1036#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);havoc ~a~0;~a~0 := 0; {1059#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {1059#(<= main_~a~0 0)} assume true; {1059#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {1059#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1059#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:19,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {1039#(<= main_~a~0 1)} assume true; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {1039#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1039#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1039#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1040#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1040#(<= main_~a~0 2)} assume true; {1040#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {1040#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1037#false} havoc ~i~0;~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1037#false} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {1037#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1037#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1037#false} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {1037#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1037#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {1037#false} ~i~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {1037#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1037#false} is VALID [2018-11-18 22:43:19,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {1037#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1037#false} is VALID [2018-11-18 22:43:19,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {1037#false} assume !(~i~0 < 100000); {1037#false} is VALID [2018-11-18 22:43:19,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {1037#false} havoc ~x~0;~x~0 := 0; {1037#false} is VALID [2018-11-18 22:43:19,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {1037#false} assume true; {1037#false} is VALID [2018-11-18 22:43:19,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {1037#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1037#false} is VALID [2018-11-18 22:43:19,835 INFO L256 TraceCheckUtils]: 35: Hoare triple {1037#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1037#false} is VALID [2018-11-18 22:43:19,835 INFO L273 TraceCheckUtils]: 36: Hoare triple {1037#false} ~cond := #in~cond; {1037#false} is VALID [2018-11-18 22:43:19,835 INFO L273 TraceCheckUtils]: 37: Hoare triple {1037#false} assume 0 == ~cond; {1037#false} is VALID [2018-11-18 22:43:19,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2018-11-18 22:43:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:43:19,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:19,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:43:19,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-18 22:43:19,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:19,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:43:19,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:19,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:43:19,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:43:19,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:43:19,925 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-11-18 22:43:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,103 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-18 22:43:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:43:20,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-18 22:43:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:43:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-18 22:43:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:43:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-18 22:43:20,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-18 22:43:20,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,213 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:43:20,213 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:43:20,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:43:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:43:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-18 22:43:20,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:20,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:20,247 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:20,247 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,251 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-18 22:43:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-18 22:43:20,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,252 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-18 22:43:20,252 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-18 22:43:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,258 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-18 22:43:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-18 22:43:20,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:20,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:43:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-18 22:43:20,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 39 [2018-11-18 22:43:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:20,262 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-18 22:43:20,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:43:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-18 22:43:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:43:20,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:20,264 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-11-18 22:43:20,264 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:20,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1164732885, now seen corresponding path program 3 times [2018-11-18 22:43:20,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:20,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2018-11-18 22:43:20,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1422#true} is VALID [2018-11-18 22:43:20,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1422#true} {1422#true} #96#return; {1422#true} is VALID [2018-11-18 22:43:20,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {1422#true} call #t~ret12 := main(); {1422#true} is VALID [2018-11-18 22:43:20,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {1422#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);havoc ~a~0;~a~0 := 0; {1424#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {1424#(= main_~a~0 0)} assume true; {1424#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {1424#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1424#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {1424#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1425#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {1425#(<= main_~a~0 1)} assume true; {1425#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {1425#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1425#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {1425#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1426#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {1426#(<= main_~a~0 2)} assume true; {1426#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {1426#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1426#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {1426#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1427#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:20,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {1427#(<= main_~a~0 3)} assume true; {1427#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:20,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {1427#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1423#false} is VALID [2018-11-18 22:43:20,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {1423#false} havoc ~i~0;~i~0 := 0; {1423#false} is VALID [2018-11-18 22:43:20,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {1423#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1423#false} is VALID [2018-11-18 22:43:20,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {1423#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1423#false} is VALID [2018-11-18 22:43:20,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {1423#false} assume !(~i~0 < 100000); {1423#false} is VALID [2018-11-18 22:43:20,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {1423#false} ~i~0 := 0; {1423#false} is VALID [2018-11-18 22:43:20,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {1423#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1423#false} is VALID [2018-11-18 22:43:20,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {1423#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1423#false} is VALID [2018-11-18 22:43:20,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {1423#false} assume !(~i~0 < 100000); {1423#false} is VALID [2018-11-18 22:43:20,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {1423#false} ~i~0 := 0; {1423#false} is VALID [2018-11-18 22:43:20,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {1423#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1423#false} is VALID [2018-11-18 22:43:20,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {1423#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1423#false} is VALID [2018-11-18 22:43:20,427 INFO L273 TraceCheckUtils]: 33: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,427 INFO L273 TraceCheckUtils]: 34: Hoare triple {1423#false} assume !(~i~0 < 100000); {1423#false} is VALID [2018-11-18 22:43:20,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {1423#false} havoc ~x~0;~x~0 := 0; {1423#false} is VALID [2018-11-18 22:43:20,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,428 INFO L273 TraceCheckUtils]: 37: Hoare triple {1423#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1423#false} is VALID [2018-11-18 22:43:20,428 INFO L256 TraceCheckUtils]: 38: Hoare triple {1423#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1423#false} is VALID [2018-11-18 22:43:20,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2018-11-18 22:43:20,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2018-11-18 22:43:20,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2018-11-18 22:43:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:43:20,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:20,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:20,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 22:43:20,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:20,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {1422#true} call ULTIMATE.init(); {1422#true} is VALID [2018-11-18 22:43:20,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {1422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1422#true} is VALID [2018-11-18 22:43:20,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1422#true} {1422#true} #96#return; {1422#true} is VALID [2018-11-18 22:43:20,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {1422#true} call #t~ret12 := main(); {1422#true} is VALID [2018-11-18 22:43:20,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1422#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);havoc ~a~0;~a~0 := 0; {1422#true} is VALID [2018-11-18 22:43:20,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1422#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1422#true} is VALID [2018-11-18 22:43:20,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {1422#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1422#true} is VALID [2018-11-18 22:43:20,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {1422#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1422#true} is VALID [2018-11-18 22:43:20,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1422#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1422#true} is VALID [2018-11-18 22:43:20,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {1422#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1422#true} is VALID [2018-11-18 22:43:20,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {1422#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1422#true} is VALID [2018-11-18 22:43:20,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {1422#true} assume !(~a~0 < 100000); {1422#true} is VALID [2018-11-18 22:43:20,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {1422#true} havoc ~i~0;~i~0 := 0; {1422#true} is VALID [2018-11-18 22:43:20,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1422#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1422#true} is VALID [2018-11-18 22:43:20,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1422#true} is VALID [2018-11-18 22:43:20,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#true} assume !(~i~0 < 100000); {1422#true} is VALID [2018-11-18 22:43:20,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#true} ~i~0 := 0; {1422#true} is VALID [2018-11-18 22:43:20,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {1422#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1422#true} is VALID [2018-11-18 22:43:20,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {1422#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1422#true} is VALID [2018-11-18 22:43:20,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {1422#true} assume true; {1422#true} is VALID [2018-11-18 22:43:20,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {1422#true} assume !(~i~0 < 100000); {1422#true} is VALID [2018-11-18 22:43:20,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#true} ~i~0 := 0; {1518#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {1518#(<= main_~i~0 0)} assume true; {1518#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {1518#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1518#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {1518#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1528#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,622 INFO L273 TraceCheckUtils]: 33: Hoare triple {1528#(<= main_~i~0 1)} assume true; {1528#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,623 INFO L273 TraceCheckUtils]: 34: Hoare triple {1528#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1423#false} is VALID [2018-11-18 22:43:20,623 INFO L273 TraceCheckUtils]: 35: Hoare triple {1423#false} havoc ~x~0;~x~0 := 0; {1423#false} is VALID [2018-11-18 22:43:20,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {1423#false} assume true; {1423#false} is VALID [2018-11-18 22:43:20,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {1423#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1423#false} is VALID [2018-11-18 22:43:20,624 INFO L256 TraceCheckUtils]: 38: Hoare triple {1423#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1423#false} is VALID [2018-11-18 22:43:20,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {1423#false} ~cond := #in~cond; {1423#false} is VALID [2018-11-18 22:43:20,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {1423#false} assume 0 == ~cond; {1423#false} is VALID [2018-11-18 22:43:20,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {1423#false} assume !false; {1423#false} is VALID [2018-11-18 22:43:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:43:20,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:20,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-18 22:43:20,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-18 22:43:20,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:20,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:43:20,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:43:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:43:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:20,729 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-18 22:43:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,120 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-11-18 22:43:21,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:43:21,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-18 22:43:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2018-11-18 22:43:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2018-11-18 22:43:21,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2018-11-18 22:43:21,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:21,302 INFO L225 Difference]: With dead ends: 93 [2018-11-18 22:43:21,302 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:43:21,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:43:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-11-18 22:43:21,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:21,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 59 states. [2018-11-18 22:43:21,362 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 59 states. [2018-11-18 22:43:21,362 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 59 states. [2018-11-18 22:43:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,364 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-18 22:43:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-18 22:43:21,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,366 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 63 states. [2018-11-18 22:43:21,366 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 63 states. [2018-11-18 22:43:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,368 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-18 22:43:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-18 22:43:21,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:21,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:43:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-18 22:43:21,372 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 42 [2018-11-18 22:43:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:21,373 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-18 22:43:21,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:43:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-18 22:43:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:43:21,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:21,374 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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] [2018-11-18 22:43:21,375 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:21,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -309650725, now seen corresponding path program 4 times [2018-11-18 22:43:21,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:21,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {1884#true} call ULTIMATE.init(); {1884#true} is VALID [2018-11-18 22:43:21,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {1884#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1884#true} is VALID [2018-11-18 22:43:21,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {1884#true} assume true; {1884#true} is VALID [2018-11-18 22:43:21,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1884#true} {1884#true} #96#return; {1884#true} is VALID [2018-11-18 22:43:21,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {1884#true} call #t~ret12 := main(); {1884#true} is VALID [2018-11-18 22:43:21,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {1884#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);havoc ~a~0;~a~0 := 0; {1886#(= main_~a~0 0)} is VALID [2018-11-18 22:43:21,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {1886#(= main_~a~0 0)} assume true; {1886#(= main_~a~0 0)} is VALID [2018-11-18 22:43:21,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {1886#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1886#(= main_~a~0 0)} is VALID [2018-11-18 22:43:21,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {1886#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {1887#(<= main_~a~0 1)} assume true; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {1887#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {1887#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {1888#(<= main_~a~0 2)} assume true; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {1888#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {1889#(<= main_~a~0 3)} assume true; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {1889#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {1889#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1890#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {1890#(<= main_~a~0 4)} assume true; {1890#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {1890#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {1885#false} havoc ~i~0;~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1885#false} is VALID [2018-11-18 22:43:21,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {1885#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1885#false} is VALID [2018-11-18 22:43:21,601 INFO L273 TraceCheckUtils]: 24: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1885#false} is VALID [2018-11-18 22:43:21,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {1885#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1885#false} is VALID [2018-11-18 22:43:21,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {1885#false} ~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1885#false} is VALID [2018-11-18 22:43:21,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {1885#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1885#false} is VALID [2018-11-18 22:43:21,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1885#false} is VALID [2018-11-18 22:43:21,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {1885#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1885#false} is VALID [2018-11-18 22:43:21,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,605 INFO L273 TraceCheckUtils]: 37: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {1885#false} ~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,605 INFO L273 TraceCheckUtils]: 40: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1885#false} is VALID [2018-11-18 22:43:21,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {1885#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1885#false} is VALID [2018-11-18 22:43:21,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1885#false} is VALID [2018-11-18 22:43:21,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {1885#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1885#false} is VALID [2018-11-18 22:43:21,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,607 INFO L273 TraceCheckUtils]: 46: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,607 INFO L273 TraceCheckUtils]: 47: Hoare triple {1885#false} havoc ~x~0;~x~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,608 INFO L273 TraceCheckUtils]: 49: Hoare triple {1885#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1885#false} is VALID [2018-11-18 22:43:21,608 INFO L256 TraceCheckUtils]: 50: Hoare triple {1885#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1885#false} is VALID [2018-11-18 22:43:21,608 INFO L273 TraceCheckUtils]: 51: Hoare triple {1885#false} ~cond := #in~cond; {1885#false} is VALID [2018-11-18 22:43:21,608 INFO L273 TraceCheckUtils]: 52: Hoare triple {1885#false} assume 0 == ~cond; {1885#false} is VALID [2018-11-18 22:43:21,609 INFO L273 TraceCheckUtils]: 53: Hoare triple {1885#false} assume !false; {1885#false} is VALID [2018-11-18 22:43:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:43:21,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:21,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:21,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:21,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:21,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:21,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:21,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {1884#true} call ULTIMATE.init(); {1884#true} is VALID [2018-11-18 22:43:21,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1884#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1884#true} is VALID [2018-11-18 22:43:21,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {1884#true} assume true; {1884#true} is VALID [2018-11-18 22:43:21,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1884#true} {1884#true} #96#return; {1884#true} is VALID [2018-11-18 22:43:21,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {1884#true} call #t~ret12 := main(); {1884#true} is VALID [2018-11-18 22:43:21,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {1884#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);havoc ~a~0;~a~0 := 0; {1909#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {1909#(<= main_~a~0 0)} assume true; {1909#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {1909#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1909#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {1909#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {1887#(<= main_~a~0 1)} assume true; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {1887#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1887#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {1887#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {1888#(<= main_~a~0 2)} assume true; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {1888#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1888#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {1889#(<= main_~a~0 3)} assume true; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {1889#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1889#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {1889#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1890#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {1890#(<= main_~a~0 4)} assume true; {1890#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {1890#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {1885#false} havoc ~i~0;~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1885#false} is VALID [2018-11-18 22:43:21,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {1885#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1885#false} is VALID [2018-11-18 22:43:21,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1885#false} is VALID [2018-11-18 22:43:21,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {1885#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1885#false} is VALID [2018-11-18 22:43:21,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {1885#false} ~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1885#false} is VALID [2018-11-18 22:43:21,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {1885#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1885#false} is VALID [2018-11-18 22:43:21,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1885#false} is VALID [2018-11-18 22:43:21,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {1885#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1885#false} is VALID [2018-11-18 22:43:21,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {1885#false} ~i~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1885#false} is VALID [2018-11-18 22:43:21,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {1885#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1885#false} is VALID [2018-11-18 22:43:21,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {1885#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1885#false} is VALID [2018-11-18 22:43:21,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {1885#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1885#false} is VALID [2018-11-18 22:43:21,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {1885#false} assume !(~i~0 < 100000); {1885#false} is VALID [2018-11-18 22:43:21,888 INFO L273 TraceCheckUtils]: 47: Hoare triple {1885#false} havoc ~x~0;~x~0 := 0; {1885#false} is VALID [2018-11-18 22:43:21,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {1885#false} assume true; {1885#false} is VALID [2018-11-18 22:43:21,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {1885#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1885#false} is VALID [2018-11-18 22:43:21,888 INFO L256 TraceCheckUtils]: 50: Hoare triple {1885#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1885#false} is VALID [2018-11-18 22:43:21,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {1885#false} ~cond := #in~cond; {1885#false} is VALID [2018-11-18 22:43:21,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {1885#false} assume 0 == ~cond; {1885#false} is VALID [2018-11-18 22:43:21,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {1885#false} assume !false; {1885#false} is VALID [2018-11-18 22:43:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:43:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:43:21,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-18 22:43:21,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:21,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:43:21,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:21,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:43:21,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:43:21,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:21,970 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 8 states. [2018-11-18 22:43:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,299 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-18 22:43:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:22,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-18 22:43:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-18 22:43:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-18 22:43:22,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-18 22:43:22,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,399 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:43:22,400 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:43:22,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:43:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-18 22:43:22,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:22,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:22,429 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:22,429 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,432 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-18 22:43:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-18 22:43:22,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:22,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:22,433 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-18 22:43:22,433 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-18 22:43:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,436 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-18 22:43:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-18 22:43:22,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:22,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:22,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:22,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:43:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-18 22:43:22,439 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 54 [2018-11-18 22:43:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:22,440 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-18 22:43:22,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:43:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 22:43:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 22:43:22,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:22,441 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 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] [2018-11-18 22:43:22,441 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:22,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1841584316, now seen corresponding path program 5 times [2018-11-18 22:43:22,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:22,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {2399#true} call ULTIMATE.init(); {2399#true} is VALID [2018-11-18 22:43:22,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {2399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2399#true} is VALID [2018-11-18 22:43:22,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {2399#true} assume true; {2399#true} is VALID [2018-11-18 22:43:22,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2399#true} {2399#true} #96#return; {2399#true} is VALID [2018-11-18 22:43:22,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {2399#true} call #t~ret12 := main(); {2399#true} is VALID [2018-11-18 22:43:22,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {2399#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);havoc ~a~0;~a~0 := 0; {2401#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {2401#(= main_~a~0 0)} assume true; {2401#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {2401#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2401#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {2401#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {2402#(<= main_~a~0 1)} assume true; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {2402#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {2402#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {2403#(<= main_~a~0 2)} assume true; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {2403#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {2403#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {2404#(<= main_~a~0 3)} assume true; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {2404#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {2405#(<= main_~a~0 4)} assume true; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {2405#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {2405#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:22,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {2406#(<= main_~a~0 5)} assume true; {2406#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:22,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {2406#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:22,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {2400#false} havoc ~i~0;~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:22,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2400#false} is VALID [2018-11-18 22:43:22,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {2400#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#false} is VALID [2018-11-18 22:43:22,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2400#false} is VALID [2018-11-18 22:43:22,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {2400#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#false} is VALID [2018-11-18 22:43:22,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:22,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {2400#false} ~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:22,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2400#false} is VALID [2018-11-18 22:43:22,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {2400#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2400#false} is VALID [2018-11-18 22:43:22,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2400#false} is VALID [2018-11-18 22:43:22,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {2400#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2400#false} is VALID [2018-11-18 22:43:22,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {2400#false} ~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2400#false} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {2400#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2400#false} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {2400#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {2400#false} havoc ~x~0;~x~0 := 0; {2400#false} is VALID [2018-11-18 22:43:22,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:22,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {2400#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2400#false} is VALID [2018-11-18 22:43:22,782 INFO L256 TraceCheckUtils]: 53: Hoare triple {2400#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2400#false} is VALID [2018-11-18 22:43:22,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {2400#false} ~cond := #in~cond; {2400#false} is VALID [2018-11-18 22:43:22,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {2400#false} assume 0 == ~cond; {2400#false} is VALID [2018-11-18 22:43:22,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {2400#false} assume !false; {2400#false} is VALID [2018-11-18 22:43:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:43:22,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:22,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:22,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:23,451 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:43:23,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:23,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:23,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {2399#true} call ULTIMATE.init(); {2399#true} is VALID [2018-11-18 22:43:23,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {2399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2399#true} is VALID [2018-11-18 22:43:23,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {2399#true} assume true; {2399#true} is VALID [2018-11-18 22:43:23,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2399#true} {2399#true} #96#return; {2399#true} is VALID [2018-11-18 22:43:23,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {2399#true} call #t~ret12 := main(); {2399#true} is VALID [2018-11-18 22:43:23,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {2399#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);havoc ~a~0;~a~0 := 0; {2425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {2425#(<= main_~a~0 0)} assume true; {2425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {2425#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {2425#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {2402#(<= main_~a~0 1)} assume true; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {2402#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2402#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {2402#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {2403#(<= main_~a~0 2)} assume true; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {2403#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2403#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {2403#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {2404#(<= main_~a~0 3)} assume true; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {2404#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2404#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {2405#(<= main_~a~0 4)} assume true; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {2405#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2405#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {2405#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {2406#(<= main_~a~0 5)} assume true; {2406#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {2406#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:23,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {2400#false} havoc ~i~0;~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {2400#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {2400#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#false} is VALID [2018-11-18 22:43:23,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {2400#false} ~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {2400#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2400#false} is VALID [2018-11-18 22:43:23,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2400#false} is VALID [2018-11-18 22:43:23,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {2400#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2400#false} is VALID [2018-11-18 22:43:23,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:23,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {2400#false} ~i~0 := 0; {2400#false} is VALID [2018-11-18 22:43:23,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2400#false} is VALID [2018-11-18 22:43:23,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {2400#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2400#false} is VALID [2018-11-18 22:43:23,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {2400#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2400#false} is VALID [2018-11-18 22:43:23,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {2400#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2400#false} is VALID [2018-11-18 22:43:23,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {2400#false} assume !(~i~0 < 100000); {2400#false} is VALID [2018-11-18 22:43:23,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {2400#false} havoc ~x~0;~x~0 := 0; {2400#false} is VALID [2018-11-18 22:43:23,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {2400#false} assume true; {2400#false} is VALID [2018-11-18 22:43:23,758 INFO L273 TraceCheckUtils]: 52: Hoare triple {2400#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2400#false} is VALID [2018-11-18 22:43:23,759 INFO L256 TraceCheckUtils]: 53: Hoare triple {2400#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2400#false} is VALID [2018-11-18 22:43:23,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {2400#false} ~cond := #in~cond; {2400#false} is VALID [2018-11-18 22:43:23,759 INFO L273 TraceCheckUtils]: 55: Hoare triple {2400#false} assume 0 == ~cond; {2400#false} is VALID [2018-11-18 22:43:23,759 INFO L273 TraceCheckUtils]: 56: Hoare triple {2400#false} assume !false; {2400#false} is VALID [2018-11-18 22:43:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:43:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:43:23,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-18 22:43:23,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:23,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:43:23,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:23,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:43:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:43:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:23,969 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 9 states. [2018-11-18 22:43:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,565 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-18 22:43:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:43:24,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-18 22:43:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-18 22:43:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-18 22:43:24,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-18 22:43:24,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:24,735 INFO L225 Difference]: With dead ends: 105 [2018-11-18 22:43:24,736 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 22:43:24,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 22:43:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-18 22:43:24,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:24,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-18 22:43:24,776 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-18 22:43:24,776 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-18 22:43:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,778 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-18 22:43:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-18 22:43:24,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,779 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-18 22:43:24,779 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-18 22:43:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,782 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-18 22:43:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-18 22:43:24,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:24,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 22:43:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-18 22:43:24,785 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 57 [2018-11-18 22:43:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:24,786 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-18 22:43:24,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:43:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-18 22:43:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 22:43:24,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:24,787 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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] [2018-11-18 22:43:24,787 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:24,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -217300165, now seen corresponding path program 6 times [2018-11-18 22:43:24,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:24,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:24,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:24,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:25,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2018-11-18 22:43:25,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2938#true} is VALID [2018-11-18 22:43:25,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #96#return; {2938#true} is VALID [2018-11-18 22:43:25,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret12 := main(); {2938#true} is VALID [2018-11-18 22:43:25,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {2938#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);havoc ~a~0;~a~0 := 0; {2940#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {2940#(= main_~a~0 0)} assume true; {2940#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {2940#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2940#(= main_~a~0 0)} is VALID [2018-11-18 22:43:25,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {2940#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2941#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {2941#(<= main_~a~0 1)} assume true; {2941#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {2941#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2941#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:25,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {2941#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2942#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {2942#(<= main_~a~0 2)} assume true; {2942#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {2942#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2942#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:25,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {2942#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2943#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {2943#(<= main_~a~0 3)} assume true; {2943#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {2943#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2943#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:25,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {2943#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2944#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {2944#(<= main_~a~0 4)} assume true; {2944#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {2944#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2944#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:25,042 INFO L273 TraceCheckUtils]: 20: Hoare triple {2944#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2945#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:25,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {2945#(<= main_~a~0 5)} assume true; {2945#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:25,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {2945#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2945#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:25,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {2945#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2946#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:25,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {2946#(<= main_~a~0 6)} assume true; {2946#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:25,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {2946#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {2939#false} havoc ~i~0;~i~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2939#false} is VALID [2018-11-18 22:43:25,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {2939#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2939#false} is VALID [2018-11-18 22:43:25,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2939#false} is VALID [2018-11-18 22:43:25,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {2939#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2939#false} is VALID [2018-11-18 22:43:25,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {2939#false} assume !(~i~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {2939#false} ~i~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {2939#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {2939#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {2939#false} assume !(~i~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {2939#false} ~i~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 45: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 47: Hoare triple {2939#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 48: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {2939#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2939#false} is VALID [2018-11-18 22:43:25,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {2939#false} assume !(~i~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 53: Hoare triple {2939#false} havoc ~x~0;~x~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {2939#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L256 TraceCheckUtils]: 56: Hoare triple {2939#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {2939#false} ~cond := #in~cond; {2939#false} is VALID [2018-11-18 22:43:25,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {2939#false} assume 0 == ~cond; {2939#false} is VALID [2018-11-18 22:43:25,050 INFO L273 TraceCheckUtils]: 59: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2018-11-18 22:43:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 22:43:25,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:25,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:25,104 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-18 22:43:25,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:25,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:25,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2018-11-18 22:43:25,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2938#true} is VALID [2018-11-18 22:43:25,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #96#return; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret12 := main(); {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {2938#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);havoc ~a~0;~a~0 := 0; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {2938#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {2938#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {2938#true} assume !(~a~0 < 100000); {2938#true} is VALID [2018-11-18 22:43:25,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {2938#true} havoc ~i~0;~i~0 := 0; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {2938#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {2938#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {2938#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {2938#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 33: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-18 22:43:25,311 INFO L273 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(~i~0 < 100000); {2938#true} is VALID [2018-11-18 22:43:25,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {2938#true} ~i~0 := 0; {3055#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:25,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {3055#(<= main_~i~0 0)} assume true; {3055#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:25,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {3055#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3055#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:25,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {3055#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3065#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:25,313 INFO L273 TraceCheckUtils]: 39: Hoare triple {3065#(<= main_~i~0 1)} assume true; {3065#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:25,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {3065#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3065#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:25,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {3065#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3075#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:25,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {3075#(<= main_~i~0 2)} assume true; {3075#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:25,315 INFO L273 TraceCheckUtils]: 43: Hoare triple {3075#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {2939#false} ~i~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2939#false} is VALID [2018-11-18 22:43:25,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {2939#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2939#false} is VALID [2018-11-18 22:43:25,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {2939#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2939#false} is VALID [2018-11-18 22:43:25,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {2939#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2939#false} is VALID [2018-11-18 22:43:25,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {2939#false} assume !(~i~0 < 100000); {2939#false} is VALID [2018-11-18 22:43:25,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {2939#false} havoc ~x~0;~x~0 := 0; {2939#false} is VALID [2018-11-18 22:43:25,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {2939#false} assume true; {2939#false} is VALID [2018-11-18 22:43:25,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {2939#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2939#false} is VALID [2018-11-18 22:43:25,318 INFO L256 TraceCheckUtils]: 56: Hoare triple {2939#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2939#false} is VALID [2018-11-18 22:43:25,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {2939#false} ~cond := #in~cond; {2939#false} is VALID [2018-11-18 22:43:25,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {2939#false} assume 0 == ~cond; {2939#false} is VALID [2018-11-18 22:43:25,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2018-11-18 22:43:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 22:43:25,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:25,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-11-18 22:43:25,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-11-18 22:43:25,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:25,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:25,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:25,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:25,402 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-18 22:43:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,868 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2018-11-18 22:43:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:43:25,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-11-18 22:43:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-18 22:43:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-18 22:43:25,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2018-11-18 22:43:26,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:26,037 INFO L225 Difference]: With dead ends: 120 [2018-11-18 22:43:26,037 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 22:43:26,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 22:43:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-18 22:43:26,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:26,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 77 states. [2018-11-18 22:43:26,061 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 77 states. [2018-11-18 22:43:26,061 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 77 states. [2018-11-18 22:43:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:26,064 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-18 22:43:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-18 22:43:26,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:26,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:26,064 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 81 states. [2018-11-18 22:43:26,065 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 81 states. [2018-11-18 22:43:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:26,067 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-18 22:43:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-18 22:43:26,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:26,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:26,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:26,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 22:43:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-18 22:43:26,069 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 60 [2018-11-18 22:43:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:26,070 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-18 22:43:26,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-18 22:43:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 22:43:26,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:26,071 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 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] [2018-11-18 22:43:26,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:26,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1292638837, now seen corresponding path program 7 times [2018-11-18 22:43:26,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:26,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {3554#true} call ULTIMATE.init(); {3554#true} is VALID [2018-11-18 22:43:26,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {3554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3554#true} is VALID [2018-11-18 22:43:26,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {3554#true} assume true; {3554#true} is VALID [2018-11-18 22:43:26,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3554#true} {3554#true} #96#return; {3554#true} is VALID [2018-11-18 22:43:26,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {3554#true} call #t~ret12 := main(); {3554#true} is VALID [2018-11-18 22:43:26,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {3554#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);havoc ~a~0;~a~0 := 0; {3556#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {3556#(= main_~a~0 0)} assume true; {3556#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {3556#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3556#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {3556#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {3557#(<= main_~a~0 1)} assume true; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {3557#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {3557#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {3558#(<= main_~a~0 2)} assume true; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {3558#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {3558#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {3559#(<= main_~a~0 3)} assume true; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {3559#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {3559#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {3560#(<= main_~a~0 4)} assume true; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {3560#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {3560#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {3561#(<= main_~a~0 5)} assume true; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {3561#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {3561#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {3562#(<= main_~a~0 6)} assume true; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {3562#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {3562#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3563#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {3563#(<= main_~a~0 7)} assume true; {3563#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {3563#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {3555#false} havoc ~i~0;~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,320 INFO L273 TraceCheckUtils]: 33: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 37: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 40: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,321 INFO L273 TraceCheckUtils]: 41: Hoare triple {3555#false} ~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 43: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 45: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 46: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 48: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,322 INFO L273 TraceCheckUtils]: 49: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 51: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 52: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 53: Hoare triple {3555#false} ~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 54: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 59: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 60: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {3555#false} havoc ~x~0;~x~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {3555#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L256 TraceCheckUtils]: 68: Hoare triple {3555#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {3555#false} ~cond := #in~cond; {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {3555#false} assume 0 == ~cond; {3555#false} is VALID [2018-11-18 22:43:26,325 INFO L273 TraceCheckUtils]: 71: Hoare triple {3555#false} assume !false; {3555#false} is VALID [2018-11-18 22:43:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:43:26,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:26,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:26,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:26,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {3554#true} call ULTIMATE.init(); {3554#true} is VALID [2018-11-18 22:43:26,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {3554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3554#true} is VALID [2018-11-18 22:43:26,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {3554#true} assume true; {3554#true} is VALID [2018-11-18 22:43:26,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3554#true} {3554#true} #96#return; {3554#true} is VALID [2018-11-18 22:43:26,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {3554#true} call #t~ret12 := main(); {3554#true} is VALID [2018-11-18 22:43:26,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {3554#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);havoc ~a~0;~a~0 := 0; {3582#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {3582#(<= main_~a~0 0)} assume true; {3582#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {3582#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3582#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {3582#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {3557#(<= main_~a~0 1)} assume true; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {3557#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3557#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {3557#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {3558#(<= main_~a~0 2)} assume true; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {3558#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3558#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {3558#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {3559#(<= main_~a~0 3)} assume true; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {3559#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3559#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {3559#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {3560#(<= main_~a~0 4)} assume true; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {3560#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3560#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {3560#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {3561#(<= main_~a~0 5)} assume true; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {3561#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3561#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {3561#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {3562#(<= main_~a~0 6)} assume true; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {3562#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3562#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {3562#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3563#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {3563#(<= main_~a~0 7)} assume true; {3563#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {3563#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {3555#false} havoc ~i~0;~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3555#false} is VALID [2018-11-18 22:43:26,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {3555#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3555#false} is VALID [2018-11-18 22:43:26,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 41: Hoare triple {3555#false} ~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,887 INFO L273 TraceCheckUtils]: 47: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {3555#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {3555#false} ~i~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,889 INFO L273 TraceCheckUtils]: 61: Hoare triple {3555#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3555#false} is VALID [2018-11-18 22:43:26,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {3555#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3555#false} is VALID [2018-11-18 22:43:26,890 INFO L273 TraceCheckUtils]: 63: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {3555#false} assume !(~i~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:26,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {3555#false} havoc ~x~0;~x~0 := 0; {3555#false} is VALID [2018-11-18 22:43:26,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:26,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {3555#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3555#false} is VALID [2018-11-18 22:43:26,891 INFO L256 TraceCheckUtils]: 68: Hoare triple {3555#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3555#false} is VALID [2018-11-18 22:43:26,891 INFO L273 TraceCheckUtils]: 69: Hoare triple {3555#false} ~cond := #in~cond; {3555#false} is VALID [2018-11-18 22:43:26,891 INFO L273 TraceCheckUtils]: 70: Hoare triple {3555#false} assume 0 == ~cond; {3555#false} is VALID [2018-11-18 22:43:26,891 INFO L273 TraceCheckUtils]: 71: Hoare triple {3555#false} assume !false; {3555#false} is VALID [2018-11-18 22:43:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:43:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:43:26,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-18 22:43:26,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:26,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:43:27,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:27,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:43:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:43:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:27,055 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-11-18 22:43:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,578 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-11-18 22:43:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:43:27,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-18 22:43:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-18 22:43:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-18 22:43:27,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-18 22:43:27,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:27,679 INFO L225 Difference]: With dead ends: 129 [2018-11-18 22:43:27,679 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 22:43:27,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 22:43:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-18 22:43:27,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:27,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-18 22:43:27,715 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-18 22:43:27,715 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-18 22:43:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,719 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-18 22:43:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-18 22:43:27,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:27,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:27,720 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-18 22:43:27,720 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-18 22:43:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,722 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-18 22:43:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-18 22:43:27,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:27,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:27,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:27,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 22:43:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-18 22:43:27,725 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 72 [2018-11-18 22:43:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:27,725 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-18 22:43:27,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:43:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-18 22:43:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 22:43:27,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:27,726 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 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] [2018-11-18 22:43:27,727 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:27,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -317717994, now seen corresponding path program 8 times [2018-11-18 22:43:27,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2018-11-18 22:43:28,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {4222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4222#true} is VALID [2018-11-18 22:43:28,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2018-11-18 22:43:28,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #96#return; {4222#true} is VALID [2018-11-18 22:43:28,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret12 := main(); {4222#true} is VALID [2018-11-18 22:43:28,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {4222#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);havoc ~a~0;~a~0 := 0; {4224#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~a~0 0)} assume true; {4224#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {4224#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4224#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {4224#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {4225#(<= main_~a~0 1)} assume true; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {4225#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {4225#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {4226#(<= main_~a~0 2)} assume true; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {4226#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {4226#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {4227#(<= main_~a~0 3)} assume true; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {4227#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {4227#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {4228#(<= main_~a~0 4)} assume true; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {4228#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {4228#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,104 INFO L273 TraceCheckUtils]: 21: Hoare triple {4229#(<= main_~a~0 5)} assume true; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {4229#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {4229#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,106 INFO L273 TraceCheckUtils]: 24: Hoare triple {4230#(<= main_~a~0 6)} assume true; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {4230#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {4230#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {4231#(<= main_~a~0 7)} assume true; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {4231#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {4231#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4232#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {4232#(<= main_~a~0 8)} assume true; {4232#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {4232#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {4223#false} havoc ~i~0;~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 37: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {4223#false} ~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {4223#false} ~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 59: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 63: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 65: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,125 INFO L273 TraceCheckUtils]: 66: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 67: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 68: Hoare triple {4223#false} havoc ~x~0;~x~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 69: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {4223#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L256 TraceCheckUtils]: 71: Hoare triple {4223#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 72: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2018-11-18 22:43:28,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2018-11-18 22:43:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:43:28,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:28,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:28,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:28,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:28,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:28,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2018-11-18 22:43:28,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {4222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4222#true} is VALID [2018-11-18 22:43:28,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2018-11-18 22:43:28,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #96#return; {4222#true} is VALID [2018-11-18 22:43:28,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret12 := main(); {4222#true} is VALID [2018-11-18 22:43:28,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {4222#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);havoc ~a~0;~a~0 := 0; {4251#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {4251#(<= main_~a~0 0)} assume true; {4251#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {4251#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4251#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {4251#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {4225#(<= main_~a~0 1)} assume true; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {4225#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4225#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {4225#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {4226#(<= main_~a~0 2)} assume true; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {4226#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4226#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {4226#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {4227#(<= main_~a~0 3)} assume true; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {4227#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4227#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {4227#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {4228#(<= main_~a~0 4)} assume true; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {4228#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4228#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {4228#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {4229#(<= main_~a~0 5)} assume true; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {4229#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4229#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {4229#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,321 INFO L273 TraceCheckUtils]: 24: Hoare triple {4230#(<= main_~a~0 6)} assume true; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {4230#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4230#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {4230#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {4231#(<= main_~a~0 7)} assume true; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {4231#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4231#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {4231#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4232#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {4232#(<= main_~a~0 8)} assume true; {4232#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {4232#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {4223#false} havoc ~i~0;~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 41: Hoare triple {4223#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {4223#false} ~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 49: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 50: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {4223#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {4223#false} ~i~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 57: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 60: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 61: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 62: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 63: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,330 INFO L273 TraceCheckUtils]: 64: Hoare triple {4223#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 65: Hoare triple {4223#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 66: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 67: Hoare triple {4223#false} assume !(~i~0 < 100000); {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 68: Hoare triple {4223#false} havoc ~x~0;~x~0 := 0; {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 69: Hoare triple {4223#false} assume true; {4223#false} is VALID [2018-11-18 22:43:28,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {4223#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4223#false} is VALID [2018-11-18 22:43:28,332 INFO L256 TraceCheckUtils]: 71: Hoare triple {4223#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4223#false} is VALID [2018-11-18 22:43:28,332 INFO L273 TraceCheckUtils]: 72: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2018-11-18 22:43:28,332 INFO L273 TraceCheckUtils]: 73: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2018-11-18 22:43:28,332 INFO L273 TraceCheckUtils]: 74: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2018-11-18 22:43:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:43:28,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:28,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:43:28,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-11-18 22:43:28,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:28,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:28,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:28,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:28,449 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 12 states. [2018-11-18 22:43:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:28,779 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-11-18 22:43:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:43:28,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-11-18 22:43:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2018-11-18 22:43:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2018-11-18 22:43:28,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2018-11-18 22:43:29,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:29,396 INFO L225 Difference]: With dead ends: 132 [2018-11-18 22:43:29,396 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 22:43:29,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 22:43:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-18 22:43:29,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:29,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:29,420 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:29,420 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,423 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-18 22:43:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-18 22:43:29,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:29,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:29,424 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-18 22:43:29,424 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-18 22:43:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,426 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-18 22:43:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-18 22:43:29,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:29,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:29,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:29,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 22:43:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-18 22:43:29,429 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 75 [2018-11-18 22:43:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:29,429 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-18 22:43:29,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-18 22:43:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 22:43:29,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:29,430 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 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] [2018-11-18 22:43:29,431 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:29,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 326626005, now seen corresponding path program 9 times [2018-11-18 22:43:29,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:29,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:30,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {4914#true} call ULTIMATE.init(); {4914#true} is VALID [2018-11-18 22:43:30,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {4914#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4914#true} is VALID [2018-11-18 22:43:30,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4914#true} {4914#true} #96#return; {4914#true} is VALID [2018-11-18 22:43:30,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {4914#true} call #t~ret12 := main(); {4914#true} is VALID [2018-11-18 22:43:30,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {4914#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);havoc ~a~0;~a~0 := 0; {4916#(= main_~a~0 0)} is VALID [2018-11-18 22:43:30,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {4916#(= main_~a~0 0)} assume true; {4916#(= main_~a~0 0)} is VALID [2018-11-18 22:43:30,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {4916#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4916#(= main_~a~0 0)} is VALID [2018-11-18 22:43:30,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {4916#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4917#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {4917#(<= main_~a~0 1)} assume true; {4917#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {4917#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4917#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {4917#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4918#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {4918#(<= main_~a~0 2)} assume true; {4918#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {4918#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4918#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {4918#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4919#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {4919#(<= main_~a~0 3)} assume true; {4919#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {4919#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4919#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {4919#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4920#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {4920#(<= main_~a~0 4)} assume true; {4920#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {4920#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4920#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {4920#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4921#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {4921#(<= main_~a~0 5)} assume true; {4921#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {4921#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4921#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {4921#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4922#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {4922#(<= main_~a~0 6)} assume true; {4922#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {4922#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4922#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {4922#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4923#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {4923#(<= main_~a~0 7)} assume true; {4923#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {4923#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4923#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {4923#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4924#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {4924#(<= main_~a~0 8)} assume true; {4924#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,652 INFO L273 TraceCheckUtils]: 31: Hoare triple {4924#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4924#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {4924#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4925#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:30,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {4925#(<= main_~a~0 9)} assume true; {4925#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:30,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {4925#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {4915#false} havoc ~i~0;~i~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4915#false} is VALID [2018-11-18 22:43:30,654 INFO L273 TraceCheckUtils]: 38: Hoare triple {4915#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4915#false} is VALID [2018-11-18 22:43:30,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4915#false} is VALID [2018-11-18 22:43:30,655 INFO L273 TraceCheckUtils]: 41: Hoare triple {4915#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4915#false} is VALID [2018-11-18 22:43:30,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4915#false} is VALID [2018-11-18 22:43:30,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {4915#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4915#false} is VALID [2018-11-18 22:43:30,655 INFO L273 TraceCheckUtils]: 45: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {4915#false} assume !(~i~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 47: Hoare triple {4915#false} ~i~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 49: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 50: Hoare triple {4915#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4915#false} is VALID [2018-11-18 22:43:30,656 INFO L273 TraceCheckUtils]: 51: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 52: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {4915#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 55: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 56: Hoare triple {4915#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 57: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 58: Hoare triple {4915#false} assume !(~i~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 59: Hoare triple {4915#false} ~i~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 61: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 62: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 63: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 67: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,658 INFO L273 TraceCheckUtils]: 68: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L273 TraceCheckUtils]: 69: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L273 TraceCheckUtils]: 70: Hoare triple {4915#false} assume !(~i~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {4915#false} havoc ~x~0;~x~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L273 TraceCheckUtils]: 72: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L273 TraceCheckUtils]: 73: Hoare triple {4915#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4915#false} is VALID [2018-11-18 22:43:30,659 INFO L256 TraceCheckUtils]: 74: Hoare triple {4915#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4915#false} is VALID [2018-11-18 22:43:30,660 INFO L273 TraceCheckUtils]: 75: Hoare triple {4915#false} ~cond := #in~cond; {4915#false} is VALID [2018-11-18 22:43:30,660 INFO L273 TraceCheckUtils]: 76: Hoare triple {4915#false} assume 0 == ~cond; {4915#false} is VALID [2018-11-18 22:43:30,660 INFO L273 TraceCheckUtils]: 77: Hoare triple {4915#false} assume !false; {4915#false} is VALID [2018-11-18 22:43:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 22:43:30,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:30,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:30,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:30,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:43:30,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:30,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:30,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {4914#true} call ULTIMATE.init(); {4914#true} is VALID [2018-11-18 22:43:30,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {4914#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4914#true} is VALID [2018-11-18 22:43:30,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4914#true} {4914#true} #96#return; {4914#true} is VALID [2018-11-18 22:43:30,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {4914#true} call #t~ret12 := main(); {4914#true} is VALID [2018-11-18 22:43:30,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {4914#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);havoc ~a~0;~a~0 := 0; {4914#true} is VALID [2018-11-18 22:43:30,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {4914#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {4914#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {4914#true} assume !(~a~0 < 100000); {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 35: Hoare triple {4914#true} havoc ~i~0;~i~0 := 0; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {4914#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4914#true} is VALID [2018-11-18 22:43:30,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {4914#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4914#true} is VALID [2018-11-18 22:43:30,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {4914#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4914#true} is VALID [2018-11-18 22:43:30,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {4914#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4914#true} is VALID [2018-11-18 22:43:30,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {4914#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4914#true} is VALID [2018-11-18 22:43:30,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {4914#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4914#true} is VALID [2018-11-18 22:43:30,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {4914#true} assume true; {4914#true} is VALID [2018-11-18 22:43:30,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {4914#true} assume !(~i~0 < 100000); {4914#true} is VALID [2018-11-18 22:43:30,970 INFO L273 TraceCheckUtils]: 47: Hoare triple {4914#true} ~i~0 := 0; {5070#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:30,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {5070#(<= main_~i~0 0)} assume true; {5070#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:30,972 INFO L273 TraceCheckUtils]: 49: Hoare triple {5070#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5070#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:30,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {5070#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5080#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:30,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {5080#(<= main_~i~0 1)} assume true; {5080#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:30,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {5080#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5080#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:30,975 INFO L273 TraceCheckUtils]: 53: Hoare triple {5080#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5090#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:30,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {5090#(<= main_~i~0 2)} assume true; {5090#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:30,976 INFO L273 TraceCheckUtils]: 55: Hoare triple {5090#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5090#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:30,976 INFO L273 TraceCheckUtils]: 56: Hoare triple {5090#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5100#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:30,977 INFO L273 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~i~0 3)} assume true; {5100#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:30,977 INFO L273 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~i~0 3)} assume !(~i~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {4915#false} ~i~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,977 INFO L273 TraceCheckUtils]: 60: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,978 INFO L273 TraceCheckUtils]: 61: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,978 INFO L273 TraceCheckUtils]: 62: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,978 INFO L273 TraceCheckUtils]: 63: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,978 INFO L273 TraceCheckUtils]: 64: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,979 INFO L273 TraceCheckUtils]: 65: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,979 INFO L273 TraceCheckUtils]: 66: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,979 INFO L273 TraceCheckUtils]: 67: Hoare triple {4915#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4915#false} is VALID [2018-11-18 22:43:30,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {4915#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4915#false} is VALID [2018-11-18 22:43:30,980 INFO L273 TraceCheckUtils]: 69: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,980 INFO L273 TraceCheckUtils]: 70: Hoare triple {4915#false} assume !(~i~0 < 100000); {4915#false} is VALID [2018-11-18 22:43:30,980 INFO L273 TraceCheckUtils]: 71: Hoare triple {4915#false} havoc ~x~0;~x~0 := 0; {4915#false} is VALID [2018-11-18 22:43:30,980 INFO L273 TraceCheckUtils]: 72: Hoare triple {4915#false} assume true; {4915#false} is VALID [2018-11-18 22:43:30,980 INFO L273 TraceCheckUtils]: 73: Hoare triple {4915#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4915#false} is VALID [2018-11-18 22:43:30,981 INFO L256 TraceCheckUtils]: 74: Hoare triple {4915#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4915#false} is VALID [2018-11-18 22:43:30,981 INFO L273 TraceCheckUtils]: 75: Hoare triple {4915#false} ~cond := #in~cond; {4915#false} is VALID [2018-11-18 22:43:30,981 INFO L273 TraceCheckUtils]: 76: Hoare triple {4915#false} assume 0 == ~cond; {4915#false} is VALID [2018-11-18 22:43:30,981 INFO L273 TraceCheckUtils]: 77: Hoare triple {4915#false} assume !false; {4915#false} is VALID [2018-11-18 22:43:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-18 22:43:31,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:31,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-18 22:43:31,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2018-11-18 22:43:31,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:31,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:43:31,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:43:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:43:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:43:31,159 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 16 states. [2018-11-18 22:43:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,969 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-11-18 22:43:31,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:43:31,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2018-11-18 22:43:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:43:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2018-11-18 22:43:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:43:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2018-11-18 22:43:31,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 134 transitions. [2018-11-18 22:43:32,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:32,536 INFO L225 Difference]: With dead ends: 147 [2018-11-18 22:43:32,536 INFO L226 Difference]: Without dead ends: 99 [2018-11-18 22:43:32,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:43:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-18 22:43:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-18 22:43:32,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:32,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 95 states. [2018-11-18 22:43:32,575 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 95 states. [2018-11-18 22:43:32,575 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 95 states. [2018-11-18 22:43:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:32,578 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-18 22:43:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-18 22:43:32,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:32,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:32,579 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 99 states. [2018-11-18 22:43:32,579 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 99 states. [2018-11-18 22:43:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:32,581 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-18 22:43:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-18 22:43:32,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:32,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:32,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:32,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:43:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-18 22:43:32,585 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 78 [2018-11-18 22:43:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:32,585 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-18 22:43:32,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:43:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-18 22:43:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:43:32,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:32,587 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 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] [2018-11-18 22:43:32,587 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:32,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:32,588 INFO L82 PathProgramCache]: Analyzing trace with hash -581801253, now seen corresponding path program 10 times [2018-11-18 22:43:32,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:32,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:32,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:33,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {5684#true} call ULTIMATE.init(); {5684#true} is VALID [2018-11-18 22:43:33,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {5684#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5684#true} is VALID [2018-11-18 22:43:33,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {5684#true} assume true; {5684#true} is VALID [2018-11-18 22:43:33,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5684#true} {5684#true} #96#return; {5684#true} is VALID [2018-11-18 22:43:33,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {5684#true} call #t~ret12 := main(); {5684#true} is VALID [2018-11-18 22:43:33,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {5684#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);havoc ~a~0;~a~0 := 0; {5686#(= main_~a~0 0)} is VALID [2018-11-18 22:43:33,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {5686#(= main_~a~0 0)} assume true; {5686#(= main_~a~0 0)} is VALID [2018-11-18 22:43:33,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {5686#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5686#(= main_~a~0 0)} is VALID [2018-11-18 22:43:33,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {5686#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {5687#(<= main_~a~0 1)} assume true; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {5687#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {5687#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {5688#(<= main_~a~0 2)} assume true; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {5688#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {5688#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {5689#(<= main_~a~0 3)} assume true; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {5689#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {5689#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {5690#(<= main_~a~0 4)} assume true; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {5690#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {5690#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {5691#(<= main_~a~0 5)} assume true; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {5691#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {5691#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {5692#(<= main_~a~0 6)} assume true; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {5692#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {5692#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {5693#(<= main_~a~0 7)} assume true; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {5693#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {5693#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {5694#(<= main_~a~0 8)} assume true; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {5694#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {5694#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {5695#(<= main_~a~0 9)} assume true; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {5695#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {5695#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5696#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:33,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {5696#(<= main_~a~0 10)} assume true; {5696#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:33,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {5696#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {5685#false} havoc ~i~0;~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,173 INFO L273 TraceCheckUtils]: 46: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 48: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 52: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 53: Hoare triple {5685#false} ~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,174 INFO L273 TraceCheckUtils]: 54: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 58: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 59: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,175 INFO L273 TraceCheckUtils]: 60: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,176 INFO L273 TraceCheckUtils]: 62: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,176 INFO L273 TraceCheckUtils]: 63: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {5685#false} ~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 71: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,177 INFO L273 TraceCheckUtils]: 72: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 74: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 75: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 77: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 79: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 80: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 82: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 83: Hoare triple {5685#false} havoc ~x~0;~x~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 85: Hoare triple {5685#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L256 TraceCheckUtils]: 86: Hoare triple {5685#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 87: Hoare triple {5685#false} ~cond := #in~cond; {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {5685#false} assume 0 == ~cond; {5685#false} is VALID [2018-11-18 22:43:33,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {5685#false} assume !false; {5685#false} is VALID [2018-11-18 22:43:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 22:43:33,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:33,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:33,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:33,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:33,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:33,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {5684#true} call ULTIMATE.init(); {5684#true} is VALID [2018-11-18 22:43:33,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {5684#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5684#true} is VALID [2018-11-18 22:43:33,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {5684#true} assume true; {5684#true} is VALID [2018-11-18 22:43:33,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5684#true} {5684#true} #96#return; {5684#true} is VALID [2018-11-18 22:43:33,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {5684#true} call #t~ret12 := main(); {5684#true} is VALID [2018-11-18 22:43:33,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {5684#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);havoc ~a~0;~a~0 := 0; {5715#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:33,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {5715#(<= main_~a~0 0)} assume true; {5715#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:33,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {5715#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5715#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:33,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {5715#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {5687#(<= main_~a~0 1)} assume true; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {5687#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5687#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:33,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {5687#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {5688#(<= main_~a~0 2)} assume true; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {5688#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5688#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:33,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {5688#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {5689#(<= main_~a~0 3)} assume true; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {5689#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5689#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:33,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {5689#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {5690#(<= main_~a~0 4)} assume true; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {5690#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5690#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:33,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {5690#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {5691#(<= main_~a~0 5)} assume true; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {5691#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5691#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:33,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {5691#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {5692#(<= main_~a~0 6)} assume true; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {5692#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5692#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:33,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {5692#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {5693#(<= main_~a~0 7)} assume true; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {5693#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5693#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:33,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {5693#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {5694#(<= main_~a~0 8)} assume true; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {5694#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5694#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:33,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {5694#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {5695#(<= main_~a~0 9)} assume true; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {5695#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5695#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:33,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {5695#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5696#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:33,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {5696#(<= main_~a~0 10)} assume true; {5696#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:33,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {5696#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {5685#false} havoc ~i~0;~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,475 INFO L273 TraceCheckUtils]: 49: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5685#false} is VALID [2018-11-18 22:43:33,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {5685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5685#false} is VALID [2018-11-18 22:43:33,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,476 INFO L273 TraceCheckUtils]: 52: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {5685#false} ~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,477 INFO L273 TraceCheckUtils]: 57: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,477 INFO L273 TraceCheckUtils]: 58: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,477 INFO L273 TraceCheckUtils]: 59: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 62: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 63: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 64: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 65: Hoare triple {5685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {5685#false} ~i~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,478 INFO L273 TraceCheckUtils]: 70: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 71: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 72: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 73: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 74: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 75: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {5685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 80: Hoare triple {5685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {5685#false} assume !(~i~0 < 100000); {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {5685#false} havoc ~x~0;~x~0 := 0; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {5685#false} assume true; {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {5685#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L256 TraceCheckUtils]: 86: Hoare triple {5685#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5685#false} is VALID [2018-11-18 22:43:33,480 INFO L273 TraceCheckUtils]: 87: Hoare triple {5685#false} ~cond := #in~cond; {5685#false} is VALID [2018-11-18 22:43:33,481 INFO L273 TraceCheckUtils]: 88: Hoare triple {5685#false} assume 0 == ~cond; {5685#false} is VALID [2018-11-18 22:43:33,481 INFO L273 TraceCheckUtils]: 89: Hoare triple {5685#false} assume !false; {5685#false} is VALID [2018-11-18 22:43:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 22:43:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:43:33,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-18 22:43:33,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:33,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:43:33,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:33,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:43:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:43:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:43:33,564 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 14 states. [2018-11-18 22:43:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:33,800 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-11-18 22:43:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:43:33,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-18 22:43:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2018-11-18 22:43:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2018-11-18 22:43:33,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 98 transitions. [2018-11-18 22:43:34,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:34,299 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:43:34,299 INFO L226 Difference]: Without dead ends: 99 [2018-11-18 22:43:34,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:43:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-18 22:43:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-18 22:43:34,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:34,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 98 states. [2018-11-18 22:43:34,327 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 98 states. [2018-11-18 22:43:34,327 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 98 states. [2018-11-18 22:43:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,330 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-18 22:43:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-18 22:43:34,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:34,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:34,330 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 99 states. [2018-11-18 22:43:34,330 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 99 states. [2018-11-18 22:43:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,333 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-18 22:43:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-18 22:43:34,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:34,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:34,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:34,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 22:43:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-11-18 22:43:34,336 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 90 [2018-11-18 22:43:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:34,336 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-11-18 22:43:34,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:43:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-18 22:43:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 22:43:34,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:34,338 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 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] [2018-11-18 22:43:34,338 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:34,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:34,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1192096708, now seen corresponding path program 11 times [2018-11-18 22:43:34,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:34,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:34,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:34,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:34,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:34,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {6505#true} call ULTIMATE.init(); {6505#true} is VALID [2018-11-18 22:43:34,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {6505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6505#true} is VALID [2018-11-18 22:43:34,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:43:34,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6505#true} {6505#true} #96#return; {6505#true} is VALID [2018-11-18 22:43:34,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {6505#true} call #t~ret12 := main(); {6505#true} is VALID [2018-11-18 22:43:34,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {6505#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);havoc ~a~0;~a~0 := 0; {6507#(= main_~a~0 0)} is VALID [2018-11-18 22:43:35,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {6507#(= main_~a~0 0)} assume true; {6507#(= main_~a~0 0)} is VALID [2018-11-18 22:43:35,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {6507#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6507#(= main_~a~0 0)} is VALID [2018-11-18 22:43:35,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {6507#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6508#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:35,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {6508#(<= main_~a~0 1)} assume true; {6508#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:35,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {6508#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6508#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:35,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {6508#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6509#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:35,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {6509#(<= main_~a~0 2)} assume true; {6509#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:35,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {6509#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6509#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:35,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {6509#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6510#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:35,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {6510#(<= main_~a~0 3)} assume true; {6510#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:35,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {6510#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6510#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:35,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {6510#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6511#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:35,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {6511#(<= main_~a~0 4)} assume true; {6511#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:35,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {6511#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6511#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:35,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {6511#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6512#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:35,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {6512#(<= main_~a~0 5)} assume true; {6512#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:35,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {6512#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6512#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:35,008 INFO L273 TraceCheckUtils]: 23: Hoare triple {6512#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6513#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:35,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {6513#(<= main_~a~0 6)} assume true; {6513#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:35,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {6513#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6513#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:35,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {6513#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6514#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:35,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {6514#(<= main_~a~0 7)} assume true; {6514#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:35,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {6514#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6514#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:35,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {6514#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6515#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:35,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {6515#(<= main_~a~0 8)} assume true; {6515#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:35,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {6515#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6515#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:35,014 INFO L273 TraceCheckUtils]: 32: Hoare triple {6515#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6516#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:35,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {6516#(<= main_~a~0 9)} assume true; {6516#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:35,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {6516#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6516#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:35,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {6516#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6517#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:35,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {6517#(<= main_~a~0 10)} assume true; {6517#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:35,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {6517#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6517#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:35,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {6517#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6518#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:35,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#(<= main_~a~0 11)} assume true; {6518#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:35,019 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6506#false} is VALID [2018-11-18 22:43:35,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {6506#false} havoc ~i~0;~i~0 := 0; {6506#false} is VALID [2018-11-18 22:43:35,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6506#false} is VALID [2018-11-18 22:43:35,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {6506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6506#false} is VALID [2018-11-18 22:43:35,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6506#false} is VALID [2018-11-18 22:43:35,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {6506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6506#false} is VALID [2018-11-18 22:43:35,020 INFO L273 TraceCheckUtils]: 48: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,021 INFO L273 TraceCheckUtils]: 49: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6506#false} is VALID [2018-11-18 22:43:35,021 INFO L273 TraceCheckUtils]: 50: Hoare triple {6506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6506#false} is VALID [2018-11-18 22:43:35,021 INFO L273 TraceCheckUtils]: 51: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 53: Hoare triple {6506#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 55: Hoare triple {6506#false} assume !(~i~0 < 100000); {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 56: Hoare triple {6506#false} ~i~0 := 0; {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 57: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,022 INFO L273 TraceCheckUtils]: 58: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 59: Hoare triple {6506#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 60: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 61: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 62: Hoare triple {6506#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6506#false} is VALID [2018-11-18 22:43:35,023 INFO L273 TraceCheckUtils]: 65: Hoare triple {6506#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 67: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 68: Hoare triple {6506#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 69: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 70: Hoare triple {6506#false} assume !(~i~0 < 100000); {6506#false} is VALID [2018-11-18 22:43:35,024 INFO L273 TraceCheckUtils]: 71: Hoare triple {6506#false} ~i~0 := 0; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 72: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 73: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 74: Hoare triple {6506#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 75: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 76: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6506#false} is VALID [2018-11-18 22:43:35,025 INFO L273 TraceCheckUtils]: 77: Hoare triple {6506#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6506#false} is VALID [2018-11-18 22:43:35,026 INFO L273 TraceCheckUtils]: 78: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,026 INFO L273 TraceCheckUtils]: 79: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6506#false} is VALID [2018-11-18 22:43:35,026 INFO L273 TraceCheckUtils]: 80: Hoare triple {6506#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6506#false} is VALID [2018-11-18 22:43:35,026 INFO L273 TraceCheckUtils]: 81: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {6506#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 83: Hoare triple {6506#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 84: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 85: Hoare triple {6506#false} assume !(~i~0 < 100000); {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 86: Hoare triple {6506#false} havoc ~x~0;~x~0 := 0; {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 87: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L273 TraceCheckUtils]: 88: Hoare triple {6506#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6506#false} is VALID [2018-11-18 22:43:35,027 INFO L256 TraceCheckUtils]: 89: Hoare triple {6506#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6506#false} is VALID [2018-11-18 22:43:35,028 INFO L273 TraceCheckUtils]: 90: Hoare triple {6506#false} ~cond := #in~cond; {6506#false} is VALID [2018-11-18 22:43:35,028 INFO L273 TraceCheckUtils]: 91: Hoare triple {6506#false} assume 0 == ~cond; {6506#false} is VALID [2018-11-18 22:43:35,028 INFO L273 TraceCheckUtils]: 92: Hoare triple {6506#false} assume !false; {6506#false} is VALID [2018-11-18 22:43:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 22:43:35,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:35,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:44:05,071 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:44:05,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:05,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:05,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {6505#true} call ULTIMATE.init(); {6505#true} is VALID [2018-11-18 22:44:05,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {6505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6505#true} is VALID [2018-11-18 22:44:05,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6505#true} {6505#true} #96#return; {6505#true} is VALID [2018-11-18 22:44:05,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {6505#true} call #t~ret12 := main(); {6505#true} is VALID [2018-11-18 22:44:05,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {6505#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);havoc ~a~0;~a~0 := 0; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 25: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 26: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 34: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 36: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {6505#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6505#true} is VALID [2018-11-18 22:44:05,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {6505#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {6505#true} assume !(~a~0 < 100000); {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {6505#true} havoc ~i~0;~i~0 := 0; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {6505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 45: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 47: Hoare triple {6505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {6505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 51: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 52: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 53: Hoare triple {6505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,263 INFO L273 TraceCheckUtils]: 55: Hoare triple {6505#true} assume !(~i~0 < 100000); {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {6505#true} ~i~0 := 0; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 57: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 58: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {6505#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 60: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 61: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 62: Hoare triple {6505#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6505#true} is VALID [2018-11-18 22:44:05,264 INFO L273 TraceCheckUtils]: 63: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 64: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 65: Hoare triple {6505#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 66: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 67: Hoare triple {6505#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {6505#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 69: Hoare triple {6505#true} assume true; {6505#true} is VALID [2018-11-18 22:44:05,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {6505#true} assume !(~i~0 < 100000); {6505#true} is VALID [2018-11-18 22:44:05,266 INFO L273 TraceCheckUtils]: 71: Hoare triple {6505#true} ~i~0 := 0; {6735#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:05,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {6735#(<= main_~i~0 0)} assume true; {6735#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:05,267 INFO L273 TraceCheckUtils]: 73: Hoare triple {6735#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6735#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:05,267 INFO L273 TraceCheckUtils]: 74: Hoare triple {6735#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6745#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:05,267 INFO L273 TraceCheckUtils]: 75: Hoare triple {6745#(<= main_~i~0 1)} assume true; {6745#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:05,268 INFO L273 TraceCheckUtils]: 76: Hoare triple {6745#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6745#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:05,268 INFO L273 TraceCheckUtils]: 77: Hoare triple {6745#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6755#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:05,269 INFO L273 TraceCheckUtils]: 78: Hoare triple {6755#(<= main_~i~0 2)} assume true; {6755#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:05,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {6755#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6755#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:05,270 INFO L273 TraceCheckUtils]: 80: Hoare triple {6755#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6765#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:05,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {6765#(<= main_~i~0 3)} assume true; {6765#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:05,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {6765#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6765#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:05,272 INFO L273 TraceCheckUtils]: 83: Hoare triple {6765#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6775#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:05,272 INFO L273 TraceCheckUtils]: 84: Hoare triple {6775#(<= main_~i~0 4)} assume true; {6775#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:05,273 INFO L273 TraceCheckUtils]: 85: Hoare triple {6775#(<= main_~i~0 4)} assume !(~i~0 < 100000); {6506#false} is VALID [2018-11-18 22:44:05,273 INFO L273 TraceCheckUtils]: 86: Hoare triple {6506#false} havoc ~x~0;~x~0 := 0; {6506#false} is VALID [2018-11-18 22:44:05,273 INFO L273 TraceCheckUtils]: 87: Hoare triple {6506#false} assume true; {6506#false} is VALID [2018-11-18 22:44:05,274 INFO L273 TraceCheckUtils]: 88: Hoare triple {6506#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6506#false} is VALID [2018-11-18 22:44:05,274 INFO L256 TraceCheckUtils]: 89: Hoare triple {6506#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6506#false} is VALID [2018-11-18 22:44:05,274 INFO L273 TraceCheckUtils]: 90: Hoare triple {6506#false} ~cond := #in~cond; {6506#false} is VALID [2018-11-18 22:44:05,274 INFO L273 TraceCheckUtils]: 91: Hoare triple {6506#false} assume 0 == ~cond; {6506#false} is VALID [2018-11-18 22:44:05,275 INFO L273 TraceCheckUtils]: 92: Hoare triple {6506#false} assume !false; {6506#false} is VALID [2018-11-18 22:44:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-11-18 22:44:05,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:05,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-18 22:44:05,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-11-18 22:44:05,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:05,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:44:05,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:44:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:44:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:44:05,393 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 19 states. [2018-11-18 22:44:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:06,537 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-11-18 22:44:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:44:06,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-11-18 22:44:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:44:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 149 transitions. [2018-11-18 22:44:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:44:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 149 transitions. [2018-11-18 22:44:06,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 149 transitions. [2018-11-18 22:44:07,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:07,558 INFO L225 Difference]: With dead ends: 171 [2018-11-18 22:44:07,558 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:44:07,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:44:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:44:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-18 22:44:07,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:07,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 110 states. [2018-11-18 22:44:07,654 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 110 states. [2018-11-18 22:44:07,654 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 110 states. [2018-11-18 22:44:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:07,656 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-18 22:44:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-18 22:44:07,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:07,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:07,657 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 114 states. [2018-11-18 22:44:07,657 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 114 states. [2018-11-18 22:44:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:07,660 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-18 22:44:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-18 22:44:07,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:07,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:07,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:07,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 22:44:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-11-18 22:44:07,663 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 93 [2018-11-18 22:44:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:07,664 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-18 22:44:07,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:44:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-11-18 22:44:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 22:44:07,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:07,665 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:07,666 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:07,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -584185098, now seen corresponding path program 12 times [2018-11-18 22:44:07,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:07,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:07,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:07,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:07,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:08,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2018-11-18 22:44:08,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7405#true} is VALID [2018-11-18 22:44:08,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:08,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #96#return; {7405#true} is VALID [2018-11-18 22:44:08,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret12 := main(); {7405#true} is VALID [2018-11-18 22:44:08,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {7405#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);havoc ~a~0;~a~0 := 0; {7407#(= main_~a~0 0)} is VALID [2018-11-18 22:44:08,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {7407#(= main_~a~0 0)} assume true; {7407#(= main_~a~0 0)} is VALID [2018-11-18 22:44:08,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {7407#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7407#(= main_~a~0 0)} is VALID [2018-11-18 22:44:08,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {7407#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7408#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:08,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {7408#(<= main_~a~0 1)} assume true; {7408#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:08,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {7408#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7408#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:08,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {7408#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7409#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:08,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {7409#(<= main_~a~0 2)} assume true; {7409#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:08,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {7409#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7409#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:08,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {7409#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7410#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:08,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {7410#(<= main_~a~0 3)} assume true; {7410#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:08,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {7410#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7410#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:08,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {7410#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7411#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:08,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {7411#(<= main_~a~0 4)} assume true; {7411#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:08,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {7411#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7411#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:08,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {7411#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7412#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:08,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {7412#(<= main_~a~0 5)} assume true; {7412#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:08,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {7412#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7412#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:08,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {7412#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7413#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:08,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {7413#(<= main_~a~0 6)} assume true; {7413#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:08,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {7413#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7413#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:08,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {7413#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7414#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:08,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {7414#(<= main_~a~0 7)} assume true; {7414#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:08,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {7414#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7414#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:08,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {7414#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7415#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:08,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {7415#(<= main_~a~0 8)} assume true; {7415#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:08,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {7415#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7415#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:08,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {7415#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7416#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:08,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {7416#(<= main_~a~0 9)} assume true; {7416#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:08,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {7416#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7416#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:08,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {7416#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7417#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:08,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {7417#(<= main_~a~0 10)} assume true; {7417#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:08,397 INFO L273 TraceCheckUtils]: 37: Hoare triple {7417#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7417#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:08,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {7417#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7418#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:08,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {7418#(<= main_~a~0 11)} assume true; {7418#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:08,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {7418#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7418#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:08,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {7418#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7419#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:08,400 INFO L273 TraceCheckUtils]: 42: Hoare triple {7419#(<= main_~a~0 12)} assume true; {7419#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:08,401 INFO L273 TraceCheckUtils]: 43: Hoare triple {7419#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:08,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {7406#false} havoc ~i~0;~i~0 := 0; {7406#false} is VALID [2018-11-18 22:44:08,401 INFO L273 TraceCheckUtils]: 45: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7406#false} is VALID [2018-11-18 22:44:08,402 INFO L273 TraceCheckUtils]: 47: Hoare triple {7406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7406#false} is VALID [2018-11-18 22:44:08,402 INFO L273 TraceCheckUtils]: 48: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,402 INFO L273 TraceCheckUtils]: 49: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7406#false} is VALID [2018-11-18 22:44:08,402 INFO L273 TraceCheckUtils]: 50: Hoare triple {7406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7406#false} is VALID [2018-11-18 22:44:08,403 INFO L273 TraceCheckUtils]: 51: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,403 INFO L273 TraceCheckUtils]: 52: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7406#false} is VALID [2018-11-18 22:44:08,403 INFO L273 TraceCheckUtils]: 53: Hoare triple {7406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7406#false} is VALID [2018-11-18 22:44:08,403 INFO L273 TraceCheckUtils]: 54: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,403 INFO L273 TraceCheckUtils]: 55: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 56: Hoare triple {7406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 57: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 58: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 59: Hoare triple {7406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 60: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 61: Hoare triple {7406#false} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 62: Hoare triple {7406#false} ~i~0 := 0; {7406#false} is VALID [2018-11-18 22:44:08,404 INFO L273 TraceCheckUtils]: 63: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 64: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 65: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 66: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 67: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 68: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 69: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 70: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 71: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:08,405 INFO L273 TraceCheckUtils]: 72: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 73: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 74: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 75: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 76: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 77: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 78: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 79: Hoare triple {7406#false} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:08,406 INFO L273 TraceCheckUtils]: 80: Hoare triple {7406#false} ~i~0 := 0; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 81: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 82: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 83: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 84: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 85: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 86: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 87: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 88: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:08,407 INFO L273 TraceCheckUtils]: 89: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 90: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 91: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 92: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 93: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 94: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 95: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 96: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,408 INFO L273 TraceCheckUtils]: 97: Hoare triple {7406#false} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 98: Hoare triple {7406#false} havoc ~x~0;~x~0 := 0; {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 99: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 100: Hoare triple {7406#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L256 TraceCheckUtils]: 101: Hoare triple {7406#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 102: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 103: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2018-11-18 22:44:08,409 INFO L273 TraceCheckUtils]: 104: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2018-11-18 22:44:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-18 22:44:08,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:08,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:44:15,006 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 22:44:15,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:15,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:15,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2018-11-18 22:44:15,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7405#true} is VALID [2018-11-18 22:44:15,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #96#return; {7405#true} is VALID [2018-11-18 22:44:15,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret12 := main(); {7405#true} is VALID [2018-11-18 22:44:15,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {7405#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);havoc ~a~0;~a~0 := 0; {7405#true} is VALID [2018-11-18 22:44:15,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,589 INFO L273 TraceCheckUtils]: 37: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#true} is VALID [2018-11-18 22:44:15,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {7405#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#true} is VALID [2018-11-18 22:44:15,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-18 22:44:15,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {7405#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7543#(< main_~a~0 100000)} is VALID [2018-11-18 22:44:15,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {7543#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7547#(<= main_~a~0 100000)} is VALID [2018-11-18 22:44:15,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {7547#(<= main_~a~0 100000)} assume true; {7547#(<= main_~a~0 100000)} is VALID [2018-11-18 22:44:15,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {7547#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {7405#true} is VALID [2018-11-18 22:44:15,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {7405#true} havoc ~i~0;~i~0 := 0; {7557#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:15,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {7557#(<= main_~i~0 0)} assume true; {7557#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:15,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {7557#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7557#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:15,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {7557#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:15,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {7567#(<= main_~i~0 1)} assume true; {7567#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:15,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {7567#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7567#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:15,640 INFO L273 TraceCheckUtils]: 50: Hoare triple {7567#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7577#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:15,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {7577#(<= main_~i~0 2)} assume true; {7577#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:15,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {7577#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7577#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:15,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {7577#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7587#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:15,642 INFO L273 TraceCheckUtils]: 54: Hoare triple {7587#(<= main_~i~0 3)} assume true; {7587#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:15,642 INFO L273 TraceCheckUtils]: 55: Hoare triple {7587#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7587#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:15,642 INFO L273 TraceCheckUtils]: 56: Hoare triple {7587#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7597#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:15,643 INFO L273 TraceCheckUtils]: 57: Hoare triple {7597#(<= main_~i~0 4)} assume true; {7597#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:15,643 INFO L273 TraceCheckUtils]: 58: Hoare triple {7597#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7597#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:15,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {7597#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7607#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:15,645 INFO L273 TraceCheckUtils]: 60: Hoare triple {7607#(<= main_~i~0 5)} assume true; {7607#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:15,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {7607#(<= main_~i~0 5)} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 62: Hoare triple {7406#false} ~i~0 := 0; {7406#false} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 63: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 64: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 67: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 69: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 70: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 72: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 73: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 74: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 75: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 76: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {7406#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 79: Hoare triple {7406#false} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 80: Hoare triple {7406#false} ~i~0 := 0; {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 81: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 82: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 83: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 84: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 85: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 88: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 89: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 90: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 93: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 94: Hoare triple {7406#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 95: Hoare triple {7406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 96: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 97: Hoare triple {7406#false} assume !(~i~0 < 100000); {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 98: Hoare triple {7406#false} havoc ~x~0;~x~0 := 0; {7406#false} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 99: Hoare triple {7406#false} assume true; {7406#false} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 100: Hoare triple {7406#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7406#false} is VALID [2018-11-18 22:44:15,652 INFO L256 TraceCheckUtils]: 101: Hoare triple {7406#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7406#false} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 102: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 103: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 104: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2018-11-18 22:44:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 35 proven. 40 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-11-18 22:44:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-18 22:44:15,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 105 [2018-11-18 22:44:15,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:15,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:44:15,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:15,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:44:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:44:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:44:15,769 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 23 states. [2018-11-18 22:44:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:17,115 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-11-18 22:44:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:44:17,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 105 [2018-11-18 22:44:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2018-11-18 22:44:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2018-11-18 22:44:17,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 164 transitions. [2018-11-18 22:44:17,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:17,834 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:44:17,834 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 22:44:17,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:44:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 22:44:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-11-18 22:44:17,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:17,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 125 states. [2018-11-18 22:44:17,996 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 125 states. [2018-11-18 22:44:17,996 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 125 states. [2018-11-18 22:44:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,000 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-18 22:44:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-18 22:44:18,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,001 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 128 states. [2018-11-18 22:44:18,001 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 128 states. [2018-11-18 22:44:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,004 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-18 22:44:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-18 22:44:18,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:18,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:44:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-18 22:44:18,008 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 105 [2018-11-18 22:44:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-18 22:44:18,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:44:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-18 22:44:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 22:44:18,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:18,010 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 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] [2018-11-18 22:44:18,011 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:18,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1927800197, now seen corresponding path program 13 times [2018-11-18 22:44:18,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:18,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:18,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:18,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {8436#true} call ULTIMATE.init(); {8436#true} is VALID [2018-11-18 22:44:18,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {8436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8436#true} is VALID [2018-11-18 22:44:18,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {8436#true} assume true; {8436#true} is VALID [2018-11-18 22:44:18,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8436#true} {8436#true} #96#return; {8436#true} is VALID [2018-11-18 22:44:18,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {8436#true} call #t~ret12 := main(); {8436#true} is VALID [2018-11-18 22:44:18,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {8436#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);havoc ~a~0;~a~0 := 0; {8438#(= main_~a~0 0)} is VALID [2018-11-18 22:44:18,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {8438#(= main_~a~0 0)} assume true; {8438#(= main_~a~0 0)} is VALID [2018-11-18 22:44:18,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {8438#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8438#(= main_~a~0 0)} is VALID [2018-11-18 22:44:18,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {8438#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {8439#(<= main_~a~0 1)} assume true; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {8439#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {8439#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {8440#(<= main_~a~0 2)} assume true; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {8440#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {8440#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {8441#(<= main_~a~0 3)} assume true; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {8441#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {8441#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {8442#(<= main_~a~0 4)} assume true; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {8442#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {8442#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {8443#(<= main_~a~0 5)} assume true; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {8443#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {8443#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {8444#(<= main_~a~0 6)} assume true; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {8444#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {8444#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {8445#(<= main_~a~0 7)} assume true; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {8445#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {8445#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {8446#(<= main_~a~0 8)} assume true; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {8446#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {8446#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {8447#(<= main_~a~0 9)} assume true; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {8447#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {8447#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {8448#(<= main_~a~0 10)} assume true; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {8448#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {8448#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {8449#(<= main_~a~0 11)} assume true; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {8449#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,507 INFO L273 TraceCheckUtils]: 41: Hoare triple {8449#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,508 INFO L273 TraceCheckUtils]: 42: Hoare triple {8450#(<= main_~a~0 12)} assume true; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {8450#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {8450#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {8451#(<= main_~a~0 13)} assume true; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,511 INFO L273 TraceCheckUtils]: 46: Hoare triple {8451#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,512 INFO L273 TraceCheckUtils]: 47: Hoare triple {8451#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8452#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:18,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {8452#(<= main_~a~0 14)} assume true; {8452#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:18,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {8452#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:18,513 INFO L273 TraceCheckUtils]: 50: Hoare triple {8437#false} havoc ~i~0;~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:18,514 INFO L273 TraceCheckUtils]: 51: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,514 INFO L273 TraceCheckUtils]: 52: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,514 INFO L273 TraceCheckUtils]: 54: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,515 INFO L273 TraceCheckUtils]: 58: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 62: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 64: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 66: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 68: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 70: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:18,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {8437#false} ~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 72: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 73: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 74: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 75: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 76: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 77: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,518 INFO L273 TraceCheckUtils]: 78: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 79: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 80: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 81: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 82: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 83: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 84: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,519 INFO L273 TraceCheckUtils]: 85: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 86: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 87: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 88: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 89: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 90: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,520 INFO L273 TraceCheckUtils]: 91: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 92: Hoare triple {8437#false} ~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 93: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 94: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 95: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 96: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 97: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,521 INFO L273 TraceCheckUtils]: 98: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 99: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 100: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 101: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 102: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 103: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 104: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,522 INFO L273 TraceCheckUtils]: 105: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 106: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 107: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 108: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 109: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 110: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 111: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,523 INFO L273 TraceCheckUtils]: 112: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L273 TraceCheckUtils]: 113: Hoare triple {8437#false} havoc ~x~0;~x~0 := 0; {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L273 TraceCheckUtils]: 114: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L273 TraceCheckUtils]: 115: Hoare triple {8437#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L256 TraceCheckUtils]: 116: Hoare triple {8437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L273 TraceCheckUtils]: 117: Hoare triple {8437#false} ~cond := #in~cond; {8437#false} is VALID [2018-11-18 22:44:18,524 INFO L273 TraceCheckUtils]: 118: Hoare triple {8437#false} assume 0 == ~cond; {8437#false} is VALID [2018-11-18 22:44:18,525 INFO L273 TraceCheckUtils]: 119: Hoare triple {8437#false} assume !false; {8437#false} is VALID [2018-11-18 22:44:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:44:18,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:18,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:18,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:18,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:19,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {8436#true} call ULTIMATE.init(); {8436#true} is VALID [2018-11-18 22:44:19,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {8436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8436#true} is VALID [2018-11-18 22:44:19,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {8436#true} assume true; {8436#true} is VALID [2018-11-18 22:44:19,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8436#true} {8436#true} #96#return; {8436#true} is VALID [2018-11-18 22:44:19,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {8436#true} call #t~ret12 := main(); {8436#true} is VALID [2018-11-18 22:44:19,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {8436#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);havoc ~a~0;~a~0 := 0; {8471#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:19,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {8471#(<= main_~a~0 0)} assume true; {8471#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:19,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {8471#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8471#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:19,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {8471#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:19,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {8439#(<= main_~a~0 1)} assume true; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:19,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {8439#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8439#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:19,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {8439#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:19,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {8440#(<= main_~a~0 2)} assume true; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:19,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {8440#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8440#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:19,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {8440#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:19,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {8441#(<= main_~a~0 3)} assume true; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:19,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {8441#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8441#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:19,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {8441#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:19,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {8442#(<= main_~a~0 4)} assume true; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:19,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {8442#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8442#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:19,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {8442#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:19,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {8443#(<= main_~a~0 5)} assume true; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:19,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {8443#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8443#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:19,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {8443#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:19,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {8444#(<= main_~a~0 6)} assume true; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:19,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {8444#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8444#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:19,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {8444#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:19,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {8445#(<= main_~a~0 7)} assume true; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:19,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {8445#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8445#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:19,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {8445#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:19,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {8446#(<= main_~a~0 8)} assume true; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:19,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {8446#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8446#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:19,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {8446#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:19,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {8447#(<= main_~a~0 9)} assume true; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:19,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {8447#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8447#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:19,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {8447#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:19,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {8448#(<= main_~a~0 10)} assume true; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:19,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {8448#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8448#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:19,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {8448#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:19,201 INFO L273 TraceCheckUtils]: 39: Hoare triple {8449#(<= main_~a~0 11)} assume true; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:19,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {8449#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8449#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:19,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {8449#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:19,203 INFO L273 TraceCheckUtils]: 42: Hoare triple {8450#(<= main_~a~0 12)} assume true; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:19,204 INFO L273 TraceCheckUtils]: 43: Hoare triple {8450#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8450#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:19,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {8450#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:19,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {8451#(<= main_~a~0 13)} assume true; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:19,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {8451#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8451#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:19,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {8451#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8452#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:19,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {8452#(<= main_~a~0 14)} assume true; {8452#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:19,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {8452#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:19,208 INFO L273 TraceCheckUtils]: 50: Hoare triple {8437#false} havoc ~i~0;~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:19,208 INFO L273 TraceCheckUtils]: 51: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,209 INFO L273 TraceCheckUtils]: 54: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,209 INFO L273 TraceCheckUtils]: 55: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,209 INFO L273 TraceCheckUtils]: 57: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,209 INFO L273 TraceCheckUtils]: 58: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,210 INFO L273 TraceCheckUtils]: 59: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,210 INFO L273 TraceCheckUtils]: 60: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,210 INFO L273 TraceCheckUtils]: 61: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,210 INFO L273 TraceCheckUtils]: 62: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,210 INFO L273 TraceCheckUtils]: 63: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,211 INFO L273 TraceCheckUtils]: 64: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,211 INFO L273 TraceCheckUtils]: 65: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,211 INFO L273 TraceCheckUtils]: 67: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8437#false} is VALID [2018-11-18 22:44:19,211 INFO L273 TraceCheckUtils]: 68: Hoare triple {8437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {8437#false} ~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 74: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,212 INFO L273 TraceCheckUtils]: 75: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 79: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 80: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 81: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 82: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 83: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 85: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {8437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:19,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {8437#false} ~i~0 := 0; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 94: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 100: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,215 INFO L273 TraceCheckUtils]: 101: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 103: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 106: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 107: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 108: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,216 INFO L273 TraceCheckUtils]: 109: Hoare triple {8437#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {8437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 112: Hoare triple {8437#false} assume !(~i~0 < 100000); {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 113: Hoare triple {8437#false} havoc ~x~0;~x~0 := 0; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 114: Hoare triple {8437#false} assume true; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 115: Hoare triple {8437#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L256 TraceCheckUtils]: 116: Hoare triple {8437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 117: Hoare triple {8437#false} ~cond := #in~cond; {8437#false} is VALID [2018-11-18 22:44:19,217 INFO L273 TraceCheckUtils]: 118: Hoare triple {8437#false} assume 0 == ~cond; {8437#false} is VALID [2018-11-18 22:44:19,218 INFO L273 TraceCheckUtils]: 119: Hoare triple {8437#false} assume !false; {8437#false} is VALID [2018-11-18 22:44:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:44:19,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:19,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:44:19,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-11-18 22:44:19,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:19,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:44:19,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:19,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:44:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:44:19,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:44:19,354 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 18 states. [2018-11-18 22:44:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:19,778 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-11-18 22:44:19,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:44:19,778 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-11-18 22:44:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:44:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-18 22:44:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:44:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-18 22:44:19,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2018-11-18 22:44:19,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:19,900 INFO L225 Difference]: With dead ends: 204 [2018-11-18 22:44:19,900 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 22:44:19,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:44:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 22:44:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-18 22:44:20,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:20,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-18 22:44:20,089 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-18 22:44:20,089 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-18 22:44:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:20,092 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-18 22:44:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-18 22:44:20,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:20,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:20,093 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-18 22:44:20,093 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-18 22:44:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:20,096 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-18 22:44:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-18 22:44:20,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:20,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:20,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:20,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:44:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-11-18 22:44:20,099 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 120 [2018-11-18 22:44:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:20,100 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-11-18 22:44:20,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:44:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-18 22:44:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 22:44:20,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:20,101 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 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] [2018-11-18 22:44:20,101 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:20,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash -627319780, now seen corresponding path program 14 times [2018-11-18 22:44:20,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:20,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:20,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {9515#true} call ULTIMATE.init(); {9515#true} is VALID [2018-11-18 22:44:20,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {9515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9515#true} is VALID [2018-11-18 22:44:20,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {9515#true} assume true; {9515#true} is VALID [2018-11-18 22:44:20,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9515#true} {9515#true} #96#return; {9515#true} is VALID [2018-11-18 22:44:20,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {9515#true} call #t~ret12 := main(); {9515#true} is VALID [2018-11-18 22:44:20,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {9515#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);havoc ~a~0;~a~0 := 0; {9517#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {9517#(= main_~a~0 0)} assume true; {9517#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {9517#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9517#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {9517#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {9518#(<= main_~a~0 1)} assume true; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {9518#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {9518#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#(<= main_~a~0 2)} assume true; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {9520#(<= main_~a~0 3)} assume true; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {9520#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {9520#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {9521#(<= main_~a~0 4)} assume true; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {9521#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {9521#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {9522#(<= main_~a~0 5)} assume true; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {9522#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {9522#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {9523#(<= main_~a~0 6)} assume true; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {9523#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {9523#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {9524#(<= main_~a~0 7)} assume true; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {9524#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {9524#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {9525#(<= main_~a~0 8)} assume true; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {9525#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {9525#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {9526#(<= main_~a~0 9)} assume true; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {9526#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {9526#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {9527#(<= main_~a~0 10)} assume true; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {9527#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {9527#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {9528#(<= main_~a~0 11)} assume true; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {9528#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {9528#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {9529#(<= main_~a~0 12)} assume true; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {9529#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,508 INFO L273 TraceCheckUtils]: 44: Hoare triple {9529#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,508 INFO L273 TraceCheckUtils]: 45: Hoare triple {9530#(<= main_~a~0 13)} assume true; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {9530#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,510 INFO L273 TraceCheckUtils]: 47: Hoare triple {9530#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,510 INFO L273 TraceCheckUtils]: 48: Hoare triple {9531#(<= main_~a~0 14)} assume true; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,511 INFO L273 TraceCheckUtils]: 49: Hoare triple {9531#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {9531#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9532#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {9532#(<= main_~a~0 15)} assume true; {9532#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {9532#(<= main_~a~0 15)} assume !(~a~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {9516#false} havoc ~i~0;~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,514 INFO L273 TraceCheckUtils]: 60: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 62: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 65: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 67: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {9516#false} ~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 80: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 82: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 83: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,517 INFO L273 TraceCheckUtils]: 84: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 86: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 87: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 88: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 89: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 90: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 91: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,518 INFO L273 TraceCheckUtils]: 92: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 93: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 94: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 95: Hoare triple {9516#false} ~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 96: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 97: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 98: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 99: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 100: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,519 INFO L273 TraceCheckUtils]: 101: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 102: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 103: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 104: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 105: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 106: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 107: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 108: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,520 INFO L273 TraceCheckUtils]: 109: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 110: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 111: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 112: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 113: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 114: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 115: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 116: Hoare triple {9516#false} havoc ~x~0;~x~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 117: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,521 INFO L273 TraceCheckUtils]: 118: Hoare triple {9516#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9516#false} is VALID [2018-11-18 22:44:20,522 INFO L256 TraceCheckUtils]: 119: Hoare triple {9516#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {9516#false} is VALID [2018-11-18 22:44:20,522 INFO L273 TraceCheckUtils]: 120: Hoare triple {9516#false} ~cond := #in~cond; {9516#false} is VALID [2018-11-18 22:44:20,522 INFO L273 TraceCheckUtils]: 121: Hoare triple {9516#false} assume 0 == ~cond; {9516#false} is VALID [2018-11-18 22:44:20,522 INFO L273 TraceCheckUtils]: 122: Hoare triple {9516#false} assume !false; {9516#false} is VALID [2018-11-18 22:44:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:44:20,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:20,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:20,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:44:20,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:44:20,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:20,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:20,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {9515#true} call ULTIMATE.init(); {9515#true} is VALID [2018-11-18 22:44:20,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {9515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9515#true} is VALID [2018-11-18 22:44:20,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {9515#true} assume true; {9515#true} is VALID [2018-11-18 22:44:20,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9515#true} {9515#true} #96#return; {9515#true} is VALID [2018-11-18 22:44:20,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {9515#true} call #t~ret12 := main(); {9515#true} is VALID [2018-11-18 22:44:20,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {9515#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);havoc ~a~0;~a~0 := 0; {9551#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:20,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {9551#(<= main_~a~0 0)} assume true; {9551#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:20,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {9551#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9551#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:20,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {9551#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {9518#(<= main_~a~0 1)} assume true; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {9518#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9518#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {9518#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#(<= main_~a~0 2)} assume true; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9519#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {9520#(<= main_~a~0 3)} assume true; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {9520#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9520#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {9520#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {9521#(<= main_~a~0 4)} assume true; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {9521#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9521#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {9521#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {9522#(<= main_~a~0 5)} assume true; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {9522#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9522#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {9522#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {9523#(<= main_~a~0 6)} assume true; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {9523#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9523#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {9523#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {9524#(<= main_~a~0 7)} assume true; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {9524#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9524#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {9524#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {9525#(<= main_~a~0 8)} assume true; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {9525#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9525#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {9525#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {9526#(<= main_~a~0 9)} assume true; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {9526#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9526#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {9526#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {9527#(<= main_~a~0 10)} assume true; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {9527#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9527#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {9527#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {9528#(<= main_~a~0 11)} assume true; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {9528#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9528#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,901 INFO L273 TraceCheckUtils]: 41: Hoare triple {9528#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {9529#(<= main_~a~0 12)} assume true; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {9529#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9529#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {9529#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,904 INFO L273 TraceCheckUtils]: 45: Hoare triple {9530#(<= main_~a~0 13)} assume true; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {9530#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9530#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,905 INFO L273 TraceCheckUtils]: 47: Hoare triple {9530#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {9531#(<= main_~a~0 14)} assume true; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {9531#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9531#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,907 INFO L273 TraceCheckUtils]: 50: Hoare triple {9531#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9532#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {9532#(<= main_~a~0 15)} assume true; {9532#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {9532#(<= main_~a~0 15)} assume !(~a~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {9516#false} havoc ~i~0;~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,909 INFO L273 TraceCheckUtils]: 56: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,909 INFO L273 TraceCheckUtils]: 57: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 63: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 67: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 68: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 69: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 70: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 71: Hoare triple {9516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 72: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 73: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,911 INFO L273 TraceCheckUtils]: 74: Hoare triple {9516#false} ~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 76: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 77: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 78: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 79: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 80: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 81: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 82: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,912 INFO L273 TraceCheckUtils]: 83: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 84: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 85: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 86: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 87: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 88: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 89: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 90: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 91: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#false} is VALID [2018-11-18 22:44:20,913 INFO L273 TraceCheckUtils]: 92: Hoare triple {9516#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 93: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 94: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 95: Hoare triple {9516#false} ~i~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 96: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 97: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 98: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 99: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,914 INFO L273 TraceCheckUtils]: 100: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 101: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 102: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 103: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 105: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 106: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 107: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 108: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,915 INFO L273 TraceCheckUtils]: 109: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 110: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 111: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 112: Hoare triple {9516#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 113: Hoare triple {9516#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 114: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 115: Hoare triple {9516#false} assume !(~i~0 < 100000); {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 116: Hoare triple {9516#false} havoc ~x~0;~x~0 := 0; {9516#false} is VALID [2018-11-18 22:44:20,916 INFO L273 TraceCheckUtils]: 117: Hoare triple {9516#false} assume true; {9516#false} is VALID [2018-11-18 22:44:20,917 INFO L273 TraceCheckUtils]: 118: Hoare triple {9516#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9516#false} is VALID [2018-11-18 22:44:20,917 INFO L256 TraceCheckUtils]: 119: Hoare triple {9516#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {9516#false} is VALID [2018-11-18 22:44:20,917 INFO L273 TraceCheckUtils]: 120: Hoare triple {9516#false} ~cond := #in~cond; {9516#false} is VALID [2018-11-18 22:44:20,917 INFO L273 TraceCheckUtils]: 121: Hoare triple {9516#false} assume 0 == ~cond; {9516#false} is VALID [2018-11-18 22:44:20,917 INFO L273 TraceCheckUtils]: 122: Hoare triple {9516#false} assume !false; {9516#false} is VALID [2018-11-18 22:44:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:44:20,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:20,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:44:20,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 123 [2018-11-18 22:44:20,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:20,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:44:21,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:21,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:44:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:44:21,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:44:21,026 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 19 states. [2018-11-18 22:44:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,570 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2018-11-18 22:44:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:44:21,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 123 [2018-11-18 22:44:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:44:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-18 22:44:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:44:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-18 22:44:21,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 113 transitions. [2018-11-18 22:44:21,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:21,678 INFO L225 Difference]: With dead ends: 207 [2018-11-18 22:44:21,678 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 22:44:21,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:44:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 22:44:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-18 22:44:21,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:21,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 131 states. [2018-11-18 22:44:21,734 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 131 states. [2018-11-18 22:44:21,734 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 131 states. [2018-11-18 22:44:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,737 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-18 22:44:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-18 22:44:21,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:21,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:21,738 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 132 states. [2018-11-18 22:44:21,738 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 132 states. [2018-11-18 22:44:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,740 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-18 22:44:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-18 22:44:21,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:21,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:21,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:21,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 22:44:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-18 22:44:21,743 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2018-11-18 22:44:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-18 22:44:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:44:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-18 22:44:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 22:44:21,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:21,745 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 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] [2018-11-18 22:44:21,745 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:21,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1379773147, now seen corresponding path program 15 times [2018-11-18 22:44:21,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:21,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:21,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:22,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {10618#true} call ULTIMATE.init(); {10618#true} is VALID [2018-11-18 22:44:22,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {10618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10618#true} is VALID [2018-11-18 22:44:22,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:22,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10618#true} {10618#true} #96#return; {10618#true} is VALID [2018-11-18 22:44:22,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {10618#true} call #t~ret12 := main(); {10618#true} is VALID [2018-11-18 22:44:22,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {10618#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);havoc ~a~0;~a~0 := 0; {10620#(= main_~a~0 0)} is VALID [2018-11-18 22:44:22,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {10620#(= main_~a~0 0)} assume true; {10620#(= main_~a~0 0)} is VALID [2018-11-18 22:44:22,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {10620#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10620#(= main_~a~0 0)} is VALID [2018-11-18 22:44:22,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {10620#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10621#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:22,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {10621#(<= main_~a~0 1)} assume true; {10621#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:22,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {10621#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10621#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:22,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {10621#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10622#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:22,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {10622#(<= main_~a~0 2)} assume true; {10622#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:22,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {10622#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10622#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:22,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {10622#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10623#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:22,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {10623#(<= main_~a~0 3)} assume true; {10623#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:22,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {10623#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10623#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:22,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {10623#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:22,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {10624#(<= main_~a~0 4)} assume true; {10624#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:22,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {10624#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10624#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:22,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {10624#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10625#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:22,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {10625#(<= main_~a~0 5)} assume true; {10625#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:22,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {10625#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10625#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:22,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {10625#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10626#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:22,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {10626#(<= main_~a~0 6)} assume true; {10626#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:22,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {10626#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10626#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:22,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {10626#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10627#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:22,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {10627#(<= main_~a~0 7)} assume true; {10627#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:22,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {10627#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10627#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:22,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {10627#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10628#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:22,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {10628#(<= main_~a~0 8)} assume true; {10628#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:22,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {10628#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10628#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:22,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {10628#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10629#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:22,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {10629#(<= main_~a~0 9)} assume true; {10629#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:22,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {10629#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10629#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:22,340 INFO L273 TraceCheckUtils]: 35: Hoare triple {10629#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10630#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:22,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {10630#(<= main_~a~0 10)} assume true; {10630#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:22,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {10630#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10630#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:22,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {10630#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10631#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:22,342 INFO L273 TraceCheckUtils]: 39: Hoare triple {10631#(<= main_~a~0 11)} assume true; {10631#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:22,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {10631#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10631#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:22,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {10631#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10632#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:22,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {10632#(<= main_~a~0 12)} assume true; {10632#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:22,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {10632#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10632#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:22,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {10632#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10633#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:22,346 INFO L273 TraceCheckUtils]: 45: Hoare triple {10633#(<= main_~a~0 13)} assume true; {10633#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:22,346 INFO L273 TraceCheckUtils]: 46: Hoare triple {10633#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10633#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:22,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {10633#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10634#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:22,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {10634#(<= main_~a~0 14)} assume true; {10634#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:22,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {10634#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10634#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:22,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {10634#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10635#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:22,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {10635#(<= main_~a~0 15)} assume true; {10635#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:22,350 INFO L273 TraceCheckUtils]: 52: Hoare triple {10635#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10635#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:22,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {10635#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10636#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:22,351 INFO L273 TraceCheckUtils]: 54: Hoare triple {10636#(<= main_~a~0 16)} assume true; {10636#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:22,352 INFO L273 TraceCheckUtils]: 55: Hoare triple {10636#(<= main_~a~0 16)} assume !(~a~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:22,352 INFO L273 TraceCheckUtils]: 56: Hoare triple {10619#false} havoc ~i~0;~i~0 := 0; {10619#false} is VALID [2018-11-18 22:44:22,352 INFO L273 TraceCheckUtils]: 57: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,353 INFO L273 TraceCheckUtils]: 59: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,354 INFO L273 TraceCheckUtils]: 64: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,354 INFO L273 TraceCheckUtils]: 65: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,354 INFO L273 TraceCheckUtils]: 66: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,354 INFO L273 TraceCheckUtils]: 67: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,354 INFO L273 TraceCheckUtils]: 68: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 69: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 70: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 71: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 72: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 73: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 74: Hoare triple {10619#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10619#false} is VALID [2018-11-18 22:44:22,355 INFO L273 TraceCheckUtils]: 75: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 76: Hoare triple {10619#false} assume !(~i~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 77: Hoare triple {10619#false} ~i~0 := 0; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 78: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 79: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 80: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 81: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 82: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 83: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,356 INFO L273 TraceCheckUtils]: 84: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 85: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 86: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 87: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 88: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 89: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 93: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 94: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 95: Hoare triple {10619#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 96: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {10619#false} assume !(~i~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {10619#false} ~i~0 := 0; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 99: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 100: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,358 INFO L273 TraceCheckUtils]: 101: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 103: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 105: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 107: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,359 INFO L273 TraceCheckUtils]: 109: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 111: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 112: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 113: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 116: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 117: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,360 INFO L273 TraceCheckUtils]: 118: Hoare triple {10619#false} assume !(~i~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 119: Hoare triple {10619#false} havoc ~x~0;~x~0 := 0; {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 121: Hoare triple {10619#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L256 TraceCheckUtils]: 122: Hoare triple {10619#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 123: Hoare triple {10619#false} ~cond := #in~cond; {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 124: Hoare triple {10619#false} assume 0 == ~cond; {10619#false} is VALID [2018-11-18 22:44:22,361 INFO L273 TraceCheckUtils]: 125: Hoare triple {10619#false} assume !false; {10619#false} is VALID [2018-11-18 22:44:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:44:22,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:22,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:22,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:44:23,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 22:44:23,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:23,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:23,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {10618#true} call ULTIMATE.init(); {10618#true} is VALID [2018-11-18 22:44:23,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {10618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10618#true} is VALID [2018-11-18 22:44:23,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10618#true} {10618#true} #96#return; {10618#true} is VALID [2018-11-18 22:44:23,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {10618#true} call #t~ret12 := main(); {10618#true} is VALID [2018-11-18 22:44:23,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {10618#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);havoc ~a~0;~a~0 := 0; {10618#true} is VALID [2018-11-18 22:44:23,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 22: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 23: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 26: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 28: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 31: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 36: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 49: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 50: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 52: Hoare triple {10618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10618#true} is VALID [2018-11-18 22:44:23,900 INFO L273 TraceCheckUtils]: 53: Hoare triple {10618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 54: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 55: Hoare triple {10618#true} assume !(~a~0 < 100000); {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 56: Hoare triple {10618#true} havoc ~i~0;~i~0 := 0; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 57: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 58: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 59: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 60: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,901 INFO L273 TraceCheckUtils]: 61: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 62: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 63: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 64: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 65: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 66: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 67: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 68: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,902 INFO L273 TraceCheckUtils]: 70: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 72: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 73: Hoare triple {10618#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 74: Hoare triple {10618#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 75: Hoare triple {10618#true} assume true; {10618#true} is VALID [2018-11-18 22:44:23,903 INFO L273 TraceCheckUtils]: 76: Hoare triple {10618#true} assume !(~i~0 < 100000); {10618#true} is VALID [2018-11-18 22:44:23,905 INFO L273 TraceCheckUtils]: 77: Hoare triple {10618#true} ~i~0 := 0; {10871#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:23,906 INFO L273 TraceCheckUtils]: 78: Hoare triple {10871#(<= main_~i~0 0)} assume true; {10871#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:23,906 INFO L273 TraceCheckUtils]: 79: Hoare triple {10871#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10871#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:23,907 INFO L273 TraceCheckUtils]: 80: Hoare triple {10871#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10881#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:23,908 INFO L273 TraceCheckUtils]: 81: Hoare triple {10881#(<= main_~i~0 1)} assume true; {10881#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:23,908 INFO L273 TraceCheckUtils]: 82: Hoare triple {10881#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10881#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:23,909 INFO L273 TraceCheckUtils]: 83: Hoare triple {10881#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10891#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:23,909 INFO L273 TraceCheckUtils]: 84: Hoare triple {10891#(<= main_~i~0 2)} assume true; {10891#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:23,910 INFO L273 TraceCheckUtils]: 85: Hoare triple {10891#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10891#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:23,911 INFO L273 TraceCheckUtils]: 86: Hoare triple {10891#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10901#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:23,911 INFO L273 TraceCheckUtils]: 87: Hoare triple {10901#(<= main_~i~0 3)} assume true; {10901#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:23,912 INFO L273 TraceCheckUtils]: 88: Hoare triple {10901#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10901#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:23,912 INFO L273 TraceCheckUtils]: 89: Hoare triple {10901#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10911#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:23,913 INFO L273 TraceCheckUtils]: 90: Hoare triple {10911#(<= main_~i~0 4)} assume true; {10911#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:23,913 INFO L273 TraceCheckUtils]: 91: Hoare triple {10911#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10911#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:23,914 INFO L273 TraceCheckUtils]: 92: Hoare triple {10911#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10921#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:23,915 INFO L273 TraceCheckUtils]: 93: Hoare triple {10921#(<= main_~i~0 5)} assume true; {10921#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:23,915 INFO L273 TraceCheckUtils]: 94: Hoare triple {10921#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10921#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:23,916 INFO L273 TraceCheckUtils]: 95: Hoare triple {10921#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10931#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:23,917 INFO L273 TraceCheckUtils]: 96: Hoare triple {10931#(<= main_~i~0 6)} assume true; {10931#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:23,917 INFO L273 TraceCheckUtils]: 97: Hoare triple {10931#(<= main_~i~0 6)} assume !(~i~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:23,917 INFO L273 TraceCheckUtils]: 98: Hoare triple {10619#false} ~i~0 := 0; {10619#false} is VALID [2018-11-18 22:44:23,918 INFO L273 TraceCheckUtils]: 99: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,918 INFO L273 TraceCheckUtils]: 100: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,918 INFO L273 TraceCheckUtils]: 101: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,918 INFO L273 TraceCheckUtils]: 102: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,918 INFO L273 TraceCheckUtils]: 103: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,919 INFO L273 TraceCheckUtils]: 104: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,919 INFO L273 TraceCheckUtils]: 105: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,919 INFO L273 TraceCheckUtils]: 106: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,919 INFO L273 TraceCheckUtils]: 107: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,919 INFO L273 TraceCheckUtils]: 108: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 109: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 110: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 111: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 112: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 113: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 114: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,920 INFO L273 TraceCheckUtils]: 115: Hoare triple {10619#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 116: Hoare triple {10619#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 117: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 118: Hoare triple {10619#false} assume !(~i~0 < 100000); {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 119: Hoare triple {10619#false} havoc ~x~0;~x~0 := 0; {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 120: Hoare triple {10619#false} assume true; {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 121: Hoare triple {10619#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L256 TraceCheckUtils]: 122: Hoare triple {10619#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {10619#false} is VALID [2018-11-18 22:44:23,921 INFO L273 TraceCheckUtils]: 123: Hoare triple {10619#false} ~cond := #in~cond; {10619#false} is VALID [2018-11-18 22:44:23,922 INFO L273 TraceCheckUtils]: 124: Hoare triple {10619#false} assume 0 == ~cond; {10619#false} is VALID [2018-11-18 22:44:23,922 INFO L273 TraceCheckUtils]: 125: Hoare triple {10619#false} assume !false; {10619#false} is VALID [2018-11-18 22:44:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 22:44:23,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:23,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2018-11-18 22:44:23,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 126 [2018-11-18 22:44:23,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:23,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:44:24,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:24,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:44:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:44:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:44:24,055 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 26 states. [2018-11-18 22:44:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,289 INFO L93 Difference]: Finished difference Result 222 states and 233 transitions. [2018-11-18 22:44:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:44:25,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 126 [2018-11-18 22:44:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 182 transitions. [2018-11-18 22:44:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 182 transitions. [2018-11-18 22:44:25,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 182 transitions. [2018-11-18 22:44:25,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:25,468 INFO L225 Difference]: With dead ends: 222 [2018-11-18 22:44:25,468 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 22:44:25,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:44:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 22:44:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-11-18 22:44:25,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:25,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 143 states. [2018-11-18 22:44:25,528 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 143 states. [2018-11-18 22:44:25,528 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 143 states. [2018-11-18 22:44:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,531 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-18 22:44:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-18 22:44:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:25,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:25,532 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 147 states. [2018-11-18 22:44:25,532 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 147 states. [2018-11-18 22:44:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,534 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-11-18 22:44:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-18 22:44:25,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:25,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:25,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:25,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 22:44:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-18 22:44:25,538 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 126 [2018-11-18 22:44:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:25,538 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-18 22:44:25,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:44:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-18 22:44:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 22:44:25,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:25,539 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:25,540 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:25,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:25,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1175811093, now seen corresponding path program 16 times [2018-11-18 22:44:25,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:25,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:25,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:26,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {11802#true} call ULTIMATE.init(); {11802#true} is VALID [2018-11-18 22:44:26,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {11802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11802#true} is VALID [2018-11-18 22:44:26,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:26,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11802#true} {11802#true} #96#return; {11802#true} is VALID [2018-11-18 22:44:26,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {11802#true} call #t~ret12 := main(); {11802#true} is VALID [2018-11-18 22:44:26,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {11802#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);havoc ~a~0;~a~0 := 0; {11804#(= main_~a~0 0)} is VALID [2018-11-18 22:44:26,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {11804#(= main_~a~0 0)} assume true; {11804#(= main_~a~0 0)} is VALID [2018-11-18 22:44:26,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {11804#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11804#(= main_~a~0 0)} is VALID [2018-11-18 22:44:26,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {11804#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11805#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:26,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {11805#(<= main_~a~0 1)} assume true; {11805#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:26,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {11805#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11805#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:26,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {11805#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11806#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:26,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {11806#(<= main_~a~0 2)} assume true; {11806#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:26,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {11806#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11806#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:26,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {11806#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11807#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:26,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {11807#(<= main_~a~0 3)} assume true; {11807#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:26,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {11807#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11807#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:26,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {11807#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11808#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:26,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {11808#(<= main_~a~0 4)} assume true; {11808#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:26,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {11808#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11808#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:26,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {11808#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11809#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:26,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {11809#(<= main_~a~0 5)} assume true; {11809#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:26,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {11809#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11809#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:26,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {11809#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11810#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:26,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {11810#(<= main_~a~0 6)} assume true; {11810#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:26,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {11810#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11810#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:26,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {11810#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11811#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:26,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {11811#(<= main_~a~0 7)} assume true; {11811#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:26,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {11811#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11811#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:26,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {11811#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11812#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:26,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {11812#(<= main_~a~0 8)} assume true; {11812#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:26,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {11812#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11812#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:26,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {11812#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11813#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:26,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {11813#(<= main_~a~0 9)} assume true; {11813#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:26,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {11813#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11813#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:26,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {11813#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11814#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:26,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {11814#(<= main_~a~0 10)} assume true; {11814#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:26,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {11814#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11814#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:26,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {11814#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11815#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:26,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {11815#(<= main_~a~0 11)} assume true; {11815#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:26,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {11815#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11815#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:26,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {11815#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11816#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:26,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {11816#(<= main_~a~0 12)} assume true; {11816#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:26,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {11816#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11816#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:26,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {11816#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11817#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:26,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {11817#(<= main_~a~0 13)} assume true; {11817#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:26,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {11817#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11817#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:26,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {11817#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11818#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:26,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {11818#(<= main_~a~0 14)} assume true; {11818#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:26,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {11818#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11818#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:26,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {11818#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11819#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:26,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {11819#(<= main_~a~0 15)} assume true; {11819#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:26,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {11819#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11819#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:26,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {11819#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11820#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:26,611 INFO L273 TraceCheckUtils]: 54: Hoare triple {11820#(<= main_~a~0 16)} assume true; {11820#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:26,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {11820#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11820#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:26,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {11820#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11821#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:26,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {11821#(<= main_~a~0 17)} assume true; {11821#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:26,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {11821#(<= main_~a~0 17)} assume !(~a~0 < 100000); {11803#false} is VALID [2018-11-18 22:44:26,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {11803#false} havoc ~i~0;~i~0 := 0; {11803#false} is VALID [2018-11-18 22:44:26,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,615 INFO L273 TraceCheckUtils]: 64: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,616 INFO L273 TraceCheckUtils]: 65: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,616 INFO L273 TraceCheckUtils]: 66: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 71: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 72: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 73: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,617 INFO L273 TraceCheckUtils]: 74: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11803#false} is VALID [2018-11-18 22:44:26,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {11803#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {11803#false} assume !(~i~0 < 100000); {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {11803#false} ~i~0 := 0; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 85: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 86: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,619 INFO L273 TraceCheckUtils]: 87: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 88: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 89: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 90: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 91: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 92: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 93: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,620 INFO L273 TraceCheckUtils]: 94: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 96: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 97: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 98: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 99: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,621 INFO L273 TraceCheckUtils]: 100: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 101: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 102: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 103: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 104: Hoare triple {11803#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 105: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 106: Hoare triple {11803#false} assume !(~i~0 < 100000); {11803#false} is VALID [2018-11-18 22:44:26,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {11803#false} ~i~0 := 0; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 108: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 109: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 110: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 111: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 112: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 113: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,623 INFO L273 TraceCheckUtils]: 114: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 115: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 116: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 117: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 118: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 119: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,624 INFO L273 TraceCheckUtils]: 120: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 121: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 122: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 123: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 124: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 125: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 126: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,625 INFO L273 TraceCheckUtils]: 127: Hoare triple {11803#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 128: Hoare triple {11803#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 129: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 130: Hoare triple {11803#false} assume !(~i~0 < 100000); {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 131: Hoare triple {11803#false} havoc ~x~0;~x~0 := 0; {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 132: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L273 TraceCheckUtils]: 133: Hoare triple {11803#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {11803#false} is VALID [2018-11-18 22:44:26,626 INFO L256 TraceCheckUtils]: 134: Hoare triple {11803#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {11803#false} is VALID [2018-11-18 22:44:26,627 INFO L273 TraceCheckUtils]: 135: Hoare triple {11803#false} ~cond := #in~cond; {11803#false} is VALID [2018-11-18 22:44:26,627 INFO L273 TraceCheckUtils]: 136: Hoare triple {11803#false} assume 0 == ~cond; {11803#false} is VALID [2018-11-18 22:44:26,627 INFO L273 TraceCheckUtils]: 137: Hoare triple {11803#false} assume !false; {11803#false} is VALID [2018-11-18 22:44:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-18 22:44:26,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:26,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:44:26,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:44:26,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:26,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:27,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {11802#true} call ULTIMATE.init(); {11802#true} is VALID [2018-11-18 22:44:27,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {11802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11802#true} {11802#true} #96#return; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {11802#true} call #t~ret12 := main(); {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {11802#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);havoc ~a~0;~a~0 := 0; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 35: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 49: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 52: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {11802#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {11802#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {11802#true} assume !(~a~0 < 100000); {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {11802#true} havoc ~i~0;~i~0 := 0; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 60: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 61: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,152 INFO L273 TraceCheckUtils]: 62: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 63: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 64: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 65: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 66: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 67: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 68: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 69: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 70: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,153 INFO L273 TraceCheckUtils]: 71: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 72: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 73: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 74: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 75: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 78: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,154 INFO L273 TraceCheckUtils]: 79: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 80: Hoare triple {11802#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 81: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 82: Hoare triple {11802#true} assume !(~i~0 < 100000); {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 83: Hoare triple {11802#true} ~i~0 := 0; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 84: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 85: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 86: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 87: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,155 INFO L273 TraceCheckUtils]: 88: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 89: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 90: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 91: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 93: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 94: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,156 INFO L273 TraceCheckUtils]: 95: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 96: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 97: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 98: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 99: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 100: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,157 INFO L273 TraceCheckUtils]: 101: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,158 INFO L273 TraceCheckUtils]: 102: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,158 INFO L273 TraceCheckUtils]: 103: Hoare triple {11802#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11802#true} is VALID [2018-11-18 22:44:27,158 INFO L273 TraceCheckUtils]: 104: Hoare triple {11802#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11802#true} is VALID [2018-11-18 22:44:27,158 INFO L273 TraceCheckUtils]: 105: Hoare triple {11802#true} assume true; {11802#true} is VALID [2018-11-18 22:44:27,158 INFO L273 TraceCheckUtils]: 106: Hoare triple {11802#true} assume !(~i~0 < 100000); {11802#true} is VALID [2018-11-18 22:44:27,161 INFO L273 TraceCheckUtils]: 107: Hoare triple {11802#true} ~i~0 := 0; {12146#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:27,161 INFO L273 TraceCheckUtils]: 108: Hoare triple {12146#(<= main_~i~0 0)} assume true; {12146#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:27,162 INFO L273 TraceCheckUtils]: 109: Hoare triple {12146#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12146#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:27,162 INFO L273 TraceCheckUtils]: 110: Hoare triple {12146#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12156#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:27,163 INFO L273 TraceCheckUtils]: 111: Hoare triple {12156#(<= main_~i~0 1)} assume true; {12156#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:27,163 INFO L273 TraceCheckUtils]: 112: Hoare triple {12156#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12156#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:27,163 INFO L273 TraceCheckUtils]: 113: Hoare triple {12156#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12166#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:27,164 INFO L273 TraceCheckUtils]: 114: Hoare triple {12166#(<= main_~i~0 2)} assume true; {12166#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:27,164 INFO L273 TraceCheckUtils]: 115: Hoare triple {12166#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12166#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:27,165 INFO L273 TraceCheckUtils]: 116: Hoare triple {12166#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12176#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:27,166 INFO L273 TraceCheckUtils]: 117: Hoare triple {12176#(<= main_~i~0 3)} assume true; {12176#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:27,166 INFO L273 TraceCheckUtils]: 118: Hoare triple {12176#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12176#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:27,167 INFO L273 TraceCheckUtils]: 119: Hoare triple {12176#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12186#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:27,168 INFO L273 TraceCheckUtils]: 120: Hoare triple {12186#(<= main_~i~0 4)} assume true; {12186#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:27,168 INFO L273 TraceCheckUtils]: 121: Hoare triple {12186#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12186#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:27,169 INFO L273 TraceCheckUtils]: 122: Hoare triple {12186#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12196#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:27,169 INFO L273 TraceCheckUtils]: 123: Hoare triple {12196#(<= main_~i~0 5)} assume true; {12196#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:27,170 INFO L273 TraceCheckUtils]: 124: Hoare triple {12196#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12196#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:27,171 INFO L273 TraceCheckUtils]: 125: Hoare triple {12196#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12206#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:27,171 INFO L273 TraceCheckUtils]: 126: Hoare triple {12206#(<= main_~i~0 6)} assume true; {12206#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:27,172 INFO L273 TraceCheckUtils]: 127: Hoare triple {12206#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12206#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:27,172 INFO L273 TraceCheckUtils]: 128: Hoare triple {12206#(<= main_~i~0 6)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:27,173 INFO L273 TraceCheckUtils]: 129: Hoare triple {12216#(<= main_~i~0 7)} assume true; {12216#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:27,174 INFO L273 TraceCheckUtils]: 130: Hoare triple {12216#(<= main_~i~0 7)} assume !(~i~0 < 100000); {11803#false} is VALID [2018-11-18 22:44:27,174 INFO L273 TraceCheckUtils]: 131: Hoare triple {11803#false} havoc ~x~0;~x~0 := 0; {11803#false} is VALID [2018-11-18 22:44:27,174 INFO L273 TraceCheckUtils]: 132: Hoare triple {11803#false} assume true; {11803#false} is VALID [2018-11-18 22:44:27,174 INFO L273 TraceCheckUtils]: 133: Hoare triple {11803#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {11803#false} is VALID [2018-11-18 22:44:27,174 INFO L256 TraceCheckUtils]: 134: Hoare triple {11803#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {11803#false} is VALID [2018-11-18 22:44:27,175 INFO L273 TraceCheckUtils]: 135: Hoare triple {11803#false} ~cond := #in~cond; {11803#false} is VALID [2018-11-18 22:44:27,175 INFO L273 TraceCheckUtils]: 136: Hoare triple {11803#false} assume 0 == ~cond; {11803#false} is VALID [2018-11-18 22:44:27,175 INFO L273 TraceCheckUtils]: 137: Hoare triple {11803#false} assume !false; {11803#false} is VALID [2018-11-18 22:44:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2018-11-18 22:44:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2018-11-18 22:44:27,204 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 138 [2018-11-18 22:44:27,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:27,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:44:27,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:27,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:44:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:44:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:44:27,334 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 28 states. [2018-11-18 22:44:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:28,808 INFO L93 Difference]: Finished difference Result 243 states and 254 transitions. [2018-11-18 22:44:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:44:28,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 138 [2018-11-18 22:44:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:44:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 194 transitions. [2018-11-18 22:44:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:44:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 194 transitions. [2018-11-18 22:44:28,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 194 transitions. [2018-11-18 22:44:28,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:28,999 INFO L225 Difference]: With dead ends: 243 [2018-11-18 22:44:29,000 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 22:44:29,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:44:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 22:44:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-11-18 22:44:29,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:29,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 155 states. [2018-11-18 22:44:29,061 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 155 states. [2018-11-18 22:44:29,061 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 155 states. [2018-11-18 22:44:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:29,065 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-18 22:44:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-18 22:44:29,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:29,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:29,066 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 159 states. [2018-11-18 22:44:29,066 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 159 states. [2018-11-18 22:44:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:29,069 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-18 22:44:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-18 22:44:29,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:29,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:29,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:29,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 22:44:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-11-18 22:44:29,071 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 138 [2018-11-18 22:44:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-11-18 22:44:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:44:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-18 22:44:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 22:44:29,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:29,073 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:29,073 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:29,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1767068187, now seen corresponding path program 17 times [2018-11-18 22:44:29,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:29,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:29,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:29,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2018-11-18 22:44:29,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13092#true} is VALID [2018-11-18 22:44:29,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:44:29,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #96#return; {13092#true} is VALID [2018-11-18 22:44:29,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret12 := main(); {13092#true} is VALID [2018-11-18 22:44:29,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {13092#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);havoc ~a~0;~a~0 := 0; {13094#(= main_~a~0 0)} is VALID [2018-11-18 22:44:29,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {13094#(= main_~a~0 0)} assume true; {13094#(= main_~a~0 0)} is VALID [2018-11-18 22:44:29,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {13094#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13094#(= main_~a~0 0)} is VALID [2018-11-18 22:44:29,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {13094#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13095#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:29,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {13095#(<= main_~a~0 1)} assume true; {13095#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:29,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {13095#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13095#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:29,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {13095#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13096#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:29,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {13096#(<= main_~a~0 2)} assume true; {13096#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:29,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {13096#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13096#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:29,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {13096#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13097#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:29,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {13097#(<= main_~a~0 3)} assume true; {13097#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:29,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {13097#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13097#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:29,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {13097#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13098#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:29,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {13098#(<= main_~a~0 4)} assume true; {13098#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:29,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {13098#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13098#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:29,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {13098#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13099#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:29,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {13099#(<= main_~a~0 5)} assume true; {13099#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:29,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {13099#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13099#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:29,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {13099#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13100#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:29,435 INFO L273 TraceCheckUtils]: 24: Hoare triple {13100#(<= main_~a~0 6)} assume true; {13100#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:29,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {13100#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13100#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:29,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {13100#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13101#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:29,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {13101#(<= main_~a~0 7)} assume true; {13101#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:29,437 INFO L273 TraceCheckUtils]: 28: Hoare triple {13101#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13101#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:29,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {13101#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13102#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:29,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {13102#(<= main_~a~0 8)} assume true; {13102#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:29,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {13102#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13102#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:29,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {13102#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13103#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:29,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {13103#(<= main_~a~0 9)} assume true; {13103#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:29,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {13103#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13103#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:29,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {13103#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13104#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:29,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {13104#(<= main_~a~0 10)} assume true; {13104#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:29,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {13104#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13104#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:29,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {13104#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13105#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:29,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {13105#(<= main_~a~0 11)} assume true; {13105#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:29,445 INFO L273 TraceCheckUtils]: 40: Hoare triple {13105#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13105#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:29,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {13105#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13106#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:29,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {13106#(<= main_~a~0 12)} assume true; {13106#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:29,447 INFO L273 TraceCheckUtils]: 43: Hoare triple {13106#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13106#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:29,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {13106#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13107#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:29,448 INFO L273 TraceCheckUtils]: 45: Hoare triple {13107#(<= main_~a~0 13)} assume true; {13107#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:29,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {13107#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13107#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:29,449 INFO L273 TraceCheckUtils]: 47: Hoare triple {13107#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13108#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:29,468 INFO L273 TraceCheckUtils]: 48: Hoare triple {13108#(<= main_~a~0 14)} assume true; {13108#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:29,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {13108#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13108#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:29,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {13108#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13109#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:29,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {13109#(<= main_~a~0 15)} assume true; {13109#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:29,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {13109#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13109#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:29,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {13109#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13110#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:29,480 INFO L273 TraceCheckUtils]: 54: Hoare triple {13110#(<= main_~a~0 16)} assume true; {13110#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:29,481 INFO L273 TraceCheckUtils]: 55: Hoare triple {13110#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13110#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:29,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {13110#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13111#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:29,481 INFO L273 TraceCheckUtils]: 57: Hoare triple {13111#(<= main_~a~0 17)} assume true; {13111#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:29,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {13111#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13111#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:29,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {13111#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13112#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:29,483 INFO L273 TraceCheckUtils]: 60: Hoare triple {13112#(<= main_~a~0 18)} assume true; {13112#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:29,483 INFO L273 TraceCheckUtils]: 61: Hoare triple {13112#(<= main_~a~0 18)} assume !(~a~0 < 100000); {13093#false} is VALID [2018-11-18 22:44:29,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {13093#false} havoc ~i~0;~i~0 := 0; {13093#false} is VALID [2018-11-18 22:44:29,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,485 INFO L273 TraceCheckUtils]: 67: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,485 INFO L273 TraceCheckUtils]: 68: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,486 INFO L273 TraceCheckUtils]: 70: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,486 INFO L273 TraceCheckUtils]: 72: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,486 INFO L273 TraceCheckUtils]: 73: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 74: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 75: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 76: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 77: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 78: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 79: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 80: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,487 INFO L273 TraceCheckUtils]: 81: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 82: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 83: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 84: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 85: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 86: Hoare triple {13093#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 87: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 88: Hoare triple {13093#false} assume !(~i~0 < 100000); {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 89: Hoare triple {13093#false} ~i~0 := 0; {13093#false} is VALID [2018-11-18 22:44:29,488 INFO L273 TraceCheckUtils]: 90: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 91: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 92: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 93: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 94: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 97: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,489 INFO L273 TraceCheckUtils]: 98: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 99: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 100: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 101: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 103: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 104: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 105: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 106: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,490 INFO L273 TraceCheckUtils]: 107: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 108: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 109: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 110: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 111: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 112: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 113: Hoare triple {13093#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 114: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 115: Hoare triple {13093#false} assume !(~i~0 < 100000); {13093#false} is VALID [2018-11-18 22:44:29,491 INFO L273 TraceCheckUtils]: 116: Hoare triple {13093#false} ~i~0 := 0; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 118: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 119: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 120: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 121: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 122: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 123: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,492 INFO L273 TraceCheckUtils]: 124: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 125: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 126: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 127: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 128: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 129: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 130: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 131: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 132: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,493 INFO L273 TraceCheckUtils]: 133: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 134: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 135: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 136: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 137: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 138: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 139: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 140: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 141: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,494 INFO L273 TraceCheckUtils]: 142: Hoare triple {13093#false} assume !(~i~0 < 100000); {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 143: Hoare triple {13093#false} havoc ~x~0;~x~0 := 0; {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 144: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 145: Hoare triple {13093#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L256 TraceCheckUtils]: 146: Hoare triple {13093#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 147: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 148: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2018-11-18 22:44:29,495 INFO L273 TraceCheckUtils]: 149: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2018-11-18 22:44:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 22:44:29,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:29,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:29,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:45:44,491 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-18 22:45:44,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:45,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {13092#true} call ULTIMATE.init(); {13092#true} is VALID [2018-11-18 22:45:45,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {13092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13092#true} is VALID [2018-11-18 22:45:45,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13092#true} {13092#true} #96#return; {13092#true} is VALID [2018-11-18 22:45:45,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {13092#true} call #t~ret12 := main(); {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {13092#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);havoc ~a~0;~a~0 := 0; {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 39: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 40: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 42: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 43: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 46: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 47: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 48: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 50: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 51: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 52: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,050 INFO L273 TraceCheckUtils]: 53: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 54: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 55: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 56: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 57: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {13092#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {13092#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 60: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 61: Hoare triple {13092#true} assume !(~a~0 < 100000); {13092#true} is VALID [2018-11-18 22:45:45,051 INFO L273 TraceCheckUtils]: 62: Hoare triple {13092#true} havoc ~i~0;~i~0 := 0; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 63: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 64: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 65: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 66: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 67: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 68: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 69: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,052 INFO L273 TraceCheckUtils]: 70: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 71: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 72: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 73: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 74: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 75: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 77: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 78: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 80: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 81: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 82: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 83: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 84: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 85: Hoare triple {13092#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 86: Hoare triple {13092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13092#true} is VALID [2018-11-18 22:45:45,054 INFO L273 TraceCheckUtils]: 87: Hoare triple {13092#true} assume true; {13092#true} is VALID [2018-11-18 22:45:45,055 INFO L273 TraceCheckUtils]: 88: Hoare triple {13092#true} assume !(~i~0 < 100000); {13092#true} is VALID [2018-11-18 22:45:45,055 INFO L273 TraceCheckUtils]: 89: Hoare triple {13092#true} ~i~0 := 0; {13383#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:45,055 INFO L273 TraceCheckUtils]: 90: Hoare triple {13383#(<= main_~i~0 0)} assume true; {13383#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:45,056 INFO L273 TraceCheckUtils]: 91: Hoare triple {13383#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13383#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:45,056 INFO L273 TraceCheckUtils]: 92: Hoare triple {13383#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13393#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:45,057 INFO L273 TraceCheckUtils]: 93: Hoare triple {13393#(<= main_~i~0 1)} assume true; {13393#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:45,057 INFO L273 TraceCheckUtils]: 94: Hoare triple {13393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13393#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:45,057 INFO L273 TraceCheckUtils]: 95: Hoare triple {13393#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13403#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:45,058 INFO L273 TraceCheckUtils]: 96: Hoare triple {13403#(<= main_~i~0 2)} assume true; {13403#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:45,058 INFO L273 TraceCheckUtils]: 97: Hoare triple {13403#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13403#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:45,059 INFO L273 TraceCheckUtils]: 98: Hoare triple {13403#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13413#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:45,059 INFO L273 TraceCheckUtils]: 99: Hoare triple {13413#(<= main_~i~0 3)} assume true; {13413#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:45,060 INFO L273 TraceCheckUtils]: 100: Hoare triple {13413#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13413#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:45,060 INFO L273 TraceCheckUtils]: 101: Hoare triple {13413#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13423#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:45,061 INFO L273 TraceCheckUtils]: 102: Hoare triple {13423#(<= main_~i~0 4)} assume true; {13423#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:45,061 INFO L273 TraceCheckUtils]: 103: Hoare triple {13423#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13423#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:45,062 INFO L273 TraceCheckUtils]: 104: Hoare triple {13423#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13433#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:45,063 INFO L273 TraceCheckUtils]: 105: Hoare triple {13433#(<= main_~i~0 5)} assume true; {13433#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:45,063 INFO L273 TraceCheckUtils]: 106: Hoare triple {13433#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13433#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:45,064 INFO L273 TraceCheckUtils]: 107: Hoare triple {13433#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13443#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:45,064 INFO L273 TraceCheckUtils]: 108: Hoare triple {13443#(<= main_~i~0 6)} assume true; {13443#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:45,065 INFO L273 TraceCheckUtils]: 109: Hoare triple {13443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13443#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:45,066 INFO L273 TraceCheckUtils]: 110: Hoare triple {13443#(<= main_~i~0 6)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13453#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:45,066 INFO L273 TraceCheckUtils]: 111: Hoare triple {13453#(<= main_~i~0 7)} assume true; {13453#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:45,067 INFO L273 TraceCheckUtils]: 112: Hoare triple {13453#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13453#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:45,068 INFO L273 TraceCheckUtils]: 113: Hoare triple {13453#(<= main_~i~0 7)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13463#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:45,068 INFO L273 TraceCheckUtils]: 114: Hoare triple {13463#(<= main_~i~0 8)} assume true; {13463#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:45,069 INFO L273 TraceCheckUtils]: 115: Hoare triple {13463#(<= main_~i~0 8)} assume !(~i~0 < 100000); {13093#false} is VALID [2018-11-18 22:45:45,069 INFO L273 TraceCheckUtils]: 116: Hoare triple {13093#false} ~i~0 := 0; {13093#false} is VALID [2018-11-18 22:45:45,069 INFO L273 TraceCheckUtils]: 117: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,069 INFO L273 TraceCheckUtils]: 118: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,070 INFO L273 TraceCheckUtils]: 120: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,070 INFO L273 TraceCheckUtils]: 121: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,070 INFO L273 TraceCheckUtils]: 122: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,070 INFO L273 TraceCheckUtils]: 123: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,071 INFO L273 TraceCheckUtils]: 124: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,071 INFO L273 TraceCheckUtils]: 125: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,071 INFO L273 TraceCheckUtils]: 126: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,071 INFO L273 TraceCheckUtils]: 127: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,071 INFO L273 TraceCheckUtils]: 128: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 129: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 130: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 131: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 132: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 133: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,072 INFO L273 TraceCheckUtils]: 134: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 135: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 136: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 137: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 138: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 139: Hoare triple {13093#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13093#false} is VALID [2018-11-18 22:45:45,073 INFO L273 TraceCheckUtils]: 140: Hoare triple {13093#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 141: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 142: Hoare triple {13093#false} assume !(~i~0 < 100000); {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 143: Hoare triple {13093#false} havoc ~x~0;~x~0 := 0; {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 144: Hoare triple {13093#false} assume true; {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 145: Hoare triple {13093#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L256 TraceCheckUtils]: 146: Hoare triple {13093#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 147: Hoare triple {13093#false} ~cond := #in~cond; {13093#false} is VALID [2018-11-18 22:45:45,074 INFO L273 TraceCheckUtils]: 148: Hoare triple {13093#false} assume 0 == ~cond; {13093#false} is VALID [2018-11-18 22:45:45,075 INFO L273 TraceCheckUtils]: 149: Hoare triple {13093#false} assume !false; {13093#false} is VALID [2018-11-18 22:45:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2018-11-18 22:45:45,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:45,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2018-11-18 22:45:45,115 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 150 [2018-11-18 22:45:45,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:45,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:45:45,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:45,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:45:45,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:45:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:45:45,235 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 30 states. [2018-11-18 22:45:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,350 INFO L93 Difference]: Finished difference Result 264 states and 275 transitions. [2018-11-18 22:45:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:45:46,350 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 150 [2018-11-18 22:45:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:45:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 206 transitions. [2018-11-18 22:45:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:45:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 206 transitions. [2018-11-18 22:45:46,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 206 transitions. [2018-11-18 22:45:46,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:46,551 INFO L225 Difference]: With dead ends: 264 [2018-11-18 22:45:46,551 INFO L226 Difference]: Without dead ends: 171 [2018-11-18 22:45:46,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:45:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-18 22:45:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-11-18 22:45:46,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:46,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 167 states. [2018-11-18 22:45:46,640 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 167 states. [2018-11-18 22:45:46,640 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 167 states. [2018-11-18 22:45:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,643 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-18 22:45:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2018-11-18 22:45:46,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:46,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:46,644 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 171 states. [2018-11-18 22:45:46,644 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 171 states. [2018-11-18 22:45:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,646 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-18 22:45:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2018-11-18 22:45:46,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:46,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:46,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:46,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-18 22:45:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-11-18 22:45:46,649 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 150 [2018-11-18 22:45:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:46,649 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-11-18 22:45:46,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:45:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-11-18 22:45:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 22:45:46,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:46,651 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:46,651 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:46,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash -102032299, now seen corresponding path program 18 times [2018-11-18 22:45:46,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:46,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:47,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2018-11-18 22:45:47,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {14488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14488#true} is VALID [2018-11-18 22:45:47,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2018-11-18 22:45:47,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #96#return; {14488#true} is VALID [2018-11-18 22:45:47,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret12 := main(); {14488#true} is VALID [2018-11-18 22:45:47,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {14488#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);havoc ~a~0;~a~0 := 0; {14490#(= main_~a~0 0)} is VALID [2018-11-18 22:45:47,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {14490#(= main_~a~0 0)} assume true; {14490#(= main_~a~0 0)} is VALID [2018-11-18 22:45:47,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {14490#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14490#(= main_~a~0 0)} is VALID [2018-11-18 22:45:47,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {14490#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14491#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:47,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {14491#(<= main_~a~0 1)} assume true; {14491#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:47,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {14491#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14491#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:47,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {14491#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14492#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:47,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {14492#(<= main_~a~0 2)} assume true; {14492#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:47,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {14492#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14492#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:47,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {14492#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14493#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:47,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {14493#(<= main_~a~0 3)} assume true; {14493#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:47,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {14493#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14493#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:47,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {14493#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14494#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:47,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {14494#(<= main_~a~0 4)} assume true; {14494#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:47,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {14494#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14494#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:47,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {14494#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14495#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:47,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {14495#(<= main_~a~0 5)} assume true; {14495#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:47,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {14495#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14495#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:47,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {14495#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14496#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:47,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {14496#(<= main_~a~0 6)} assume true; {14496#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:47,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {14496#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14496#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:47,069 INFO L273 TraceCheckUtils]: 26: Hoare triple {14496#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14497#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:47,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {14497#(<= main_~a~0 7)} assume true; {14497#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:47,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {14497#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14497#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:47,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {14497#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14498#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:47,072 INFO L273 TraceCheckUtils]: 30: Hoare triple {14498#(<= main_~a~0 8)} assume true; {14498#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:47,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {14498#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14498#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:47,073 INFO L273 TraceCheckUtils]: 32: Hoare triple {14498#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14499#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:47,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {14499#(<= main_~a~0 9)} assume true; {14499#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:47,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {14499#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14499#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:47,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {14499#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14500#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:47,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {14500#(<= main_~a~0 10)} assume true; {14500#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:47,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {14500#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14500#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:47,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {14500#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14501#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:47,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {14501#(<= main_~a~0 11)} assume true; {14501#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:47,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {14501#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14501#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:47,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {14501#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14502#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:47,080 INFO L273 TraceCheckUtils]: 42: Hoare triple {14502#(<= main_~a~0 12)} assume true; {14502#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:47,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {14502#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14502#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:47,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {14502#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14503#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:47,082 INFO L273 TraceCheckUtils]: 45: Hoare triple {14503#(<= main_~a~0 13)} assume true; {14503#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:47,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {14503#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14503#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:47,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {14503#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14504#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:47,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {14504#(<= main_~a~0 14)} assume true; {14504#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:47,085 INFO L273 TraceCheckUtils]: 49: Hoare triple {14504#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14504#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:47,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {14504#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14505#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:47,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {14505#(<= main_~a~0 15)} assume true; {14505#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:47,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {14505#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14505#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:47,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {14505#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14506#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:47,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {14506#(<= main_~a~0 16)} assume true; {14506#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:47,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {14506#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14506#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:47,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {14506#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14507#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:47,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {14507#(<= main_~a~0 17)} assume true; {14507#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:47,091 INFO L273 TraceCheckUtils]: 58: Hoare triple {14507#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14507#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:47,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {14507#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14508#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:47,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {14508#(<= main_~a~0 18)} assume true; {14508#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:47,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {14508#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14508#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:47,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {14508#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14509#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:47,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {14509#(<= main_~a~0 19)} assume true; {14509#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:47,096 INFO L273 TraceCheckUtils]: 64: Hoare triple {14509#(<= main_~a~0 19)} assume !(~a~0 < 100000); {14489#false} is VALID [2018-11-18 22:45:47,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {14489#false} havoc ~i~0;~i~0 := 0; {14489#false} is VALID [2018-11-18 22:45:47,096 INFO L273 TraceCheckUtils]: 66: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,096 INFO L273 TraceCheckUtils]: 67: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,097 INFO L273 TraceCheckUtils]: 68: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,097 INFO L273 TraceCheckUtils]: 69: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,097 INFO L273 TraceCheckUtils]: 71: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,098 INFO L273 TraceCheckUtils]: 72: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,098 INFO L273 TraceCheckUtils]: 73: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,098 INFO L273 TraceCheckUtils]: 74: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,098 INFO L273 TraceCheckUtils]: 75: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,098 INFO L273 TraceCheckUtils]: 76: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 78: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 79: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 80: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 81: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 82: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,099 INFO L273 TraceCheckUtils]: 83: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 88: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,100 INFO L273 TraceCheckUtils]: 89: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 91: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {14489#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 94: Hoare triple {14489#false} assume !(~i~0 < 100000); {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {14489#false} ~i~0 := 0; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 96: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,101 INFO L273 TraceCheckUtils]: 97: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 98: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 99: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 100: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 101: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 102: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 103: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 104: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 105: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,102 INFO L273 TraceCheckUtils]: 106: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 107: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 108: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 109: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 110: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 111: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 112: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 113: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,103 INFO L273 TraceCheckUtils]: 114: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 115: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 116: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 117: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 118: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 119: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 120: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 121: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 122: Hoare triple {14489#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14489#false} is VALID [2018-11-18 22:45:47,104 INFO L273 TraceCheckUtils]: 123: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 124: Hoare triple {14489#false} assume !(~i~0 < 100000); {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 125: Hoare triple {14489#false} ~i~0 := 0; {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 126: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 127: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 128: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,105 INFO L273 TraceCheckUtils]: 129: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,106 INFO L273 TraceCheckUtils]: 130: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,106 INFO L273 TraceCheckUtils]: 131: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,106 INFO L273 TraceCheckUtils]: 132: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,106 INFO L273 TraceCheckUtils]: 133: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,106 INFO L273 TraceCheckUtils]: 134: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 135: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 136: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 137: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 138: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 139: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,107 INFO L273 TraceCheckUtils]: 140: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 141: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 142: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 143: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 144: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 145: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,108 INFO L273 TraceCheckUtils]: 146: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 147: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 148: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 149: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 150: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 151: Hoare triple {14489#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14489#false} is VALID [2018-11-18 22:45:47,109 INFO L273 TraceCheckUtils]: 152: Hoare triple {14489#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L273 TraceCheckUtils]: 153: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L273 TraceCheckUtils]: 154: Hoare triple {14489#false} assume !(~i~0 < 100000); {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L273 TraceCheckUtils]: 155: Hoare triple {14489#false} havoc ~x~0;~x~0 := 0; {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L273 TraceCheckUtils]: 156: Hoare triple {14489#false} assume true; {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L273 TraceCheckUtils]: 157: Hoare triple {14489#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {14489#false} is VALID [2018-11-18 22:45:47,110 INFO L256 TraceCheckUtils]: 158: Hoare triple {14489#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {14489#false} is VALID [2018-11-18 22:45:47,111 INFO L273 TraceCheckUtils]: 159: Hoare triple {14489#false} ~cond := #in~cond; {14489#false} is VALID [2018-11-18 22:45:47,111 INFO L273 TraceCheckUtils]: 160: Hoare triple {14489#false} assume 0 == ~cond; {14489#false} is VALID [2018-11-18 22:45:47,111 INFO L273 TraceCheckUtils]: 161: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2018-11-18 22:45:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-18 22:45:47,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:47,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:47,150 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE