java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:51,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:51,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:51,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:51,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:51,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:51,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:51,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:51,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:51,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:51,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:51,364 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:51,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:51,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:51,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:51,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:51,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:51,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:51,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:51,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:51,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:51,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:51,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:51,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:51,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:51,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:51,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:51,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:51,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:51,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:51,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:51,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:51,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:51,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:51,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:51,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:51,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:58:51,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:51,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:51,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:51,407 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:51,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:51,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:51,408 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:51,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:51,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:51,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:51,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:51,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:51,410 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:51,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:51,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:51,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:51,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:51,412 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:51,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:51,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:51,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:51,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:51,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:51,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:51,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:51,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:51,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:51,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:51,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:51,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:51,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:51,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:51,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:51,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:51,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:51,499 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:51,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i [2018-11-23 11:58:51,564 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a04f0ab/f1214e96cd3040e4959f64d3f6df70ba/FLAGcbe3be3d3 [2018-11-23 11:58:52,048 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:52,049 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i [2018-11-23 11:58:52,058 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a04f0ab/f1214e96cd3040e4959f64d3f6df70ba/FLAGcbe3be3d3 [2018-11-23 11:58:52,366 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a04f0ab/f1214e96cd3040e4959f64d3f6df70ba [2018-11-23 11:58:52,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:52,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:52,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:52,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:52,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:52,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39009d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52, skipping insertion in model container [2018-11-23 11:58:52,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:52,431 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:52,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:52,701 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:52,736 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:52,765 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:52,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52 WrapperNode [2018-11-23 11:58:52,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:52,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:52,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:52,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:52,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:52,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:52,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:52,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:52,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... [2018-11-23 11:58:52,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:52,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:52,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:52,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:52,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:52,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:52,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:52,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:52,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:53,659 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:53,659 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:58:53,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:53 BoogieIcfgContainer [2018-11-23 11:58:53,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:53,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:53,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:53,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:53,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:52" (1/3) ... [2018-11-23 11:58:53,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d795712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:53, skipping insertion in model container [2018-11-23 11:58:53,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:52" (2/3) ... [2018-11-23 11:58:53,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d795712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:53, skipping insertion in model container [2018-11-23 11:58:53,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:53" (3/3) ... [2018-11-23 11:58:53,670 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_true-unreach-call_ground.i [2018-11-23 11:58:53,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:53,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:53,709 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:53,748 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:53,749 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:53,749 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:53,749 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:53,750 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:53,750 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:53,750 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:53,750 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:53,750 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:58:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:58:53,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:53,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:53,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:53,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:53,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 11:58:53,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:53,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:53,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:58:53,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 11:58:53,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:58:53,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 11:58:53,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret7 := main(); {30#true} is VALID [2018-11-23 11:58:53,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {30#true} is VALID [2018-11-23 11:58:53,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:58:53,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} havoc ~i~0;~i~0 := 0; {31#false} is VALID [2018-11-23 11:58:53,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 11:58:53,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-23 11:58:53,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {31#false} is VALID [2018-11-23 11:58:53,967 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {31#false} is VALID [2018-11-23 11:58:53,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:58:53,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 11:58:53,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:58:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:53,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:53,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:53,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:58:53,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:53,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:54,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:54,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:54,126 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:58:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:54,514 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 11:58:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:54,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:58:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:58:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:58:54,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 11:58:54,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,839 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:58:54,839 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:58:54,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:58:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:58:54,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:54,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:58:54,892 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:58:54,892 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:58:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:54,896 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:58:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:58:54,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:54,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:54,898 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:58:54,898 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:58:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:54,902 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:58:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:58:54,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:54,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:54,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:54,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:58:54,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 11:58:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:54,908 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:58:54,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:58:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:58:54,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:54,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:54,910 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:54,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 11:58:54,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 11:58:55,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-23 11:58:55,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 11:58:55,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-23 11:58:55,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret7 := main(); {168#true} is VALID [2018-11-23 11:58:55,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {170#(= main_~a~0 0)} is VALID [2018-11-23 11:58:55,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~a~0 0)} assume !(~a~0 < 100000); {169#false} is VALID [2018-11-23 11:58:55,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {169#false} havoc ~i~0;~i~0 := 0; {169#false} is VALID [2018-11-23 11:58:55,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-23 11:58:55,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} havoc ~x~0;~x~0 := 0; {169#false} is VALID [2018-11-23 11:58:55,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {169#false} is VALID [2018-11-23 11:58:55,086 INFO L256 TraceCheckUtils]: 11: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {169#false} is VALID [2018-11-23 11:58:55,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-23 11:58:55,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2018-11-23 11:58:55,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 11:58:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:55,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:55,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:55,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:58:55,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:55,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:55,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:55,151 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 11:58:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,310 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 11:58:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:55,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:58:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:58:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:58:55,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 11:58:55,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,448 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:58:55,449 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:58:55,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:58:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:58:55,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:58:55,594 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:58:55,594 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:58:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,597 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:58:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:58:55,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,598 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:58:55,598 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:58:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,601 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:58:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:58:55,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:58:55,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 11:58:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,605 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:58:55,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:58:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:58:55,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:55,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2018-11-23 11:58:55,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:55,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2018-11-23 11:58:55,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {306#true} is VALID [2018-11-23 11:58:55,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 11:58:55,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #63#return; {306#true} is VALID [2018-11-23 11:58:55,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret7 := main(); {306#true} is VALID [2018-11-23 11:58:55,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {306#true} is VALID [2018-11-23 11:58:55,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#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; {306#true} is VALID [2018-11-23 11:58:55,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {306#true} is VALID [2018-11-23 11:58:55,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {306#true} assume !(~a~0 < 100000); {306#true} is VALID [2018-11-23 11:58:55,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {306#true} havoc ~i~0;~i~0 := 0; {308#(= main_~i~0 0)} is VALID [2018-11-23 11:58:55,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(= main_~i~0 0)} assume !(~i~0 < 100000); {307#false} is VALID [2018-11-23 11:58:55,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {307#false} havoc ~x~0;~x~0 := 0; {307#false} is VALID [2018-11-23 11:58:55,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {307#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {307#false} is VALID [2018-11-23 11:58:55,843 INFO L256 TraceCheckUtils]: 13: Hoare triple {307#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {307#false} is VALID [2018-11-23 11:58:55,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2018-11-23 11:58:55,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2018-11-23 11:58:55,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {307#false} assume !false; {307#false} is VALID [2018-11-23 11:58:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:55,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:55,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:55,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:55,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:55,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:55,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:55,880 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-23 11:58:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,078 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:58:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:56,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:58:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:58:56,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:58:56,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:56,193 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:58:56,194 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:58:56,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:58:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 11:58:56,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:56,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 11:58:56,221 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 11:58:56,222 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 11:58:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,224 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:58:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:58:56,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,225 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 11:58:56,225 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 11:58:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:56,227 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:58:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:58:56,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:56,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:56,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:56,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 11:58:56,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 11:58:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:56,232 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 11:58:56,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:58:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:56,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:56,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:56,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:56,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 11:58:56,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:56,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2018-11-23 11:58:56,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {446#true} is VALID [2018-11-23 11:58:56,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2018-11-23 11:58:56,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #63#return; {446#true} is VALID [2018-11-23 11:58:56,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret7 := main(); {446#true} is VALID [2018-11-23 11:58:56,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {446#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {448#(= main_~a~0 0)} is VALID [2018-11-23 11:58:56,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {448#(= 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; {448#(= main_~a~0 0)} is VALID [2018-11-23 11:58:56,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {448#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {449#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:56,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(<= main_~a~0 1)} assume !(~a~0 < 100000); {447#false} is VALID [2018-11-23 11:58:56,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#false} havoc ~i~0;~i~0 := 0; {447#false} is VALID [2018-11-23 11:58:56,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {447#false} is VALID [2018-11-23 11:58:56,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {447#false} is VALID [2018-11-23 11:58:56,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#false} assume !(~i~0 < 100000); {447#false} is VALID [2018-11-23 11:58:56,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#false} havoc ~x~0;~x~0 := 0; {447#false} is VALID [2018-11-23 11:58:56,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {447#false} is VALID [2018-11-23 11:58:56,362 INFO L256 TraceCheckUtils]: 15: Hoare triple {447#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {447#false} is VALID [2018-11-23 11:58:56,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {447#false} ~cond := #in~cond; {447#false} is VALID [2018-11-23 11:58:56,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {447#false} assume 0 == ~cond; {447#false} is VALID [2018-11-23 11:58:56,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {447#false} assume !false; {447#false} is VALID [2018-11-23 11:58:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:56,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:56,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:56,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2018-11-23 11:58:56,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {446#true} is VALID [2018-11-23 11:58:56,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2018-11-23 11:58:56,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #63#return; {446#true} is VALID [2018-11-23 11:58:56,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret7 := main(); {446#true} is VALID [2018-11-23 11:58:56,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {446#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {468#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:56,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= 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; {468#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:56,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {449#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:56,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(<= main_~a~0 1)} assume !(~a~0 < 100000); {447#false} is VALID [2018-11-23 11:58:56,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#false} havoc ~i~0;~i~0 := 0; {447#false} is VALID [2018-11-23 11:58:56,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {447#false} is VALID [2018-11-23 11:58:56,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {447#false} is VALID [2018-11-23 11:58:56,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#false} assume !(~i~0 < 100000); {447#false} is VALID [2018-11-23 11:58:56,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#false} havoc ~x~0;~x~0 := 0; {447#false} is VALID [2018-11-23 11:58:56,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {447#false} is VALID [2018-11-23 11:58:56,661 INFO L256 TraceCheckUtils]: 15: Hoare triple {447#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {447#false} is VALID [2018-11-23 11:58:56,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {447#false} ~cond := #in~cond; {447#false} is VALID [2018-11-23 11:58:56,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {447#false} assume 0 == ~cond; {447#false} is VALID [2018-11-23 11:58:56,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {447#false} assume !false; {447#false} is VALID [2018-11-23 11:58:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:56,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:56,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:58:56,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:58:56,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:56,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:56,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:56,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:56,767 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-23 11:58:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,026 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:58:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:57,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:58:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 11:58:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 11:58:57,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2018-11-23 11:58:57,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:57,181 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:58:57,181 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:58:57,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:58:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 11:58:57,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:57,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:57,196 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:57,196 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 11:58:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,198 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:58:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:58:57,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:57,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:57,199 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 11:58:57,199 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 11:58:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,201 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:58:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:58:57,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:57,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:57,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:57,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:58:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 11:58:57,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 11:58:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:57,205 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 11:58:57,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:58:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:58:57,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:57,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:57,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2018-11-23 11:58:57,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:57,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-23 11:58:57,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-23 11:58:57,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-23 11:58:57,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #63#return; {658#true} is VALID [2018-11-23 11:58:57,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret7 := main(); {658#true} is VALID [2018-11-23 11:58:57,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {660#(= main_~a~0 0)} is VALID [2018-11-23 11:58:57,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(= 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; {660#(= main_~a~0 0)} is VALID [2018-11-23 11:58:57,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:57,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(<= 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; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:57,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {662#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:57,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= main_~a~0 2)} assume !(~a~0 < 100000); {659#false} is VALID [2018-11-23 11:58:57,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#false} havoc ~i~0;~i~0 := 0; {659#false} is VALID [2018-11-23 11:58:57,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {659#false} is VALID [2018-11-23 11:58:57,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {659#false} is VALID [2018-11-23 11:58:57,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#false} assume !(~i~0 < 100000); {659#false} is VALID [2018-11-23 11:58:57,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#false} havoc ~x~0;~x~0 := 0; {659#false} is VALID [2018-11-23 11:58:57,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {659#false} is VALID [2018-11-23 11:58:57,340 INFO L256 TraceCheckUtils]: 17: Hoare triple {659#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {659#false} is VALID [2018-11-23 11:58:57,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2018-11-23 11:58:57,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2018-11-23 11:58:57,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-23 11:58:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:57,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:57,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:57,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:57,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:57,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:57,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:57,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-23 11:58:57,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-23 11:58:57,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-23 11:58:57,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #63#return; {658#true} is VALID [2018-11-23 11:58:57,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret7 := main(); {658#true} is VALID [2018-11-23 11:58:57,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {681#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:57,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(<= 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; {681#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:57,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:57,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(<= 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; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:57,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {662#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:57,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= main_~a~0 2)} assume !(~a~0 < 100000); {659#false} is VALID [2018-11-23 11:58:57,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#false} havoc ~i~0;~i~0 := 0; {659#false} is VALID [2018-11-23 11:58:57,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {659#false} is VALID [2018-11-23 11:58:57,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {659#false} is VALID [2018-11-23 11:58:57,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#false} assume !(~i~0 < 100000); {659#false} is VALID [2018-11-23 11:58:57,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#false} havoc ~x~0;~x~0 := 0; {659#false} is VALID [2018-11-23 11:58:57,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {659#false} is VALID [2018-11-23 11:58:57,584 INFO L256 TraceCheckUtils]: 17: Hoare triple {659#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {659#false} is VALID [2018-11-23 11:58:57,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2018-11-23 11:58:57,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2018-11-23 11:58:57,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-23 11:58:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:57,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:57,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:58:57,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:58:57,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:57,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:57,662 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-23 11:58:57,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:57,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:57,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:57,663 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-23 11:58:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:57,899 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 11:58:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:57,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:58:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:58:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:58:57,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:58:57,978 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-23 11:58:57,979 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:58:57,979 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:58:57,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:58:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 11:58:58,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:58,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 11:58:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 11:58:58,017 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 11:58:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,018 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:58:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:58:58,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,020 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 11:58:58,020 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 11:58:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,022 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:58:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:58:58,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:58,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:58:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 11:58:58,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-11-23 11:58:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:58,025 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 11:58:58,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:58:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:58:58,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:58,026 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:58,027 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1131404638, now seen corresponding path program 3 times [2018-11-23 11:58:58,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:58:58,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {887#true} is VALID [2018-11-23 11:58:58,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:58:58,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #63#return; {887#true} is VALID [2018-11-23 11:58:58,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret7 := main(); {887#true} is VALID [2018-11-23 11:58:58,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {887#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {889#(= main_~a~0 0)} is VALID [2018-11-23 11:58:58,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {889#(= 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; {889#(= main_~a~0 0)} is VALID [2018-11-23 11:58:58,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {889#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:58,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {890#(<= 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; {890#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:58,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {890#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:58,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {891#(<= 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; {891#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:58,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {891#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:58,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {892#(<= main_~a~0 3)} assume !(~a~0 < 100000); {888#false} is VALID [2018-11-23 11:58:58,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {888#false} havoc ~i~0;~i~0 := 0; {888#false} is VALID [2018-11-23 11:58:58,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {888#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {888#false} is VALID [2018-11-23 11:58:58,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {888#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {888#false} is VALID [2018-11-23 11:58:58,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {888#false} assume !(~i~0 < 100000); {888#false} is VALID [2018-11-23 11:58:58,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#false} havoc ~x~0;~x~0 := 0; {888#false} is VALID [2018-11-23 11:58:58,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {888#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {888#false} is VALID [2018-11-23 11:58:58,169 INFO L256 TraceCheckUtils]: 19: Hoare triple {888#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {888#false} is VALID [2018-11-23 11:58:58,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:58:58,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#false} assume 0 == ~cond; {888#false} is VALID [2018-11-23 11:58:58,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:58:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:58,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:58,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:58,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:58,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:58:58,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:58,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:58,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:58:58,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {887#true} is VALID [2018-11-23 11:58:58,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:58:58,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #63#return; {887#true} is VALID [2018-11-23 11:58:58,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret7 := main(); {887#true} is VALID [2018-11-23 11:58:58,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {887#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {887#true} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {887#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; {887#true} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {887#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; {887#true} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:58:58,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {887#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; {887#true} is VALID [2018-11-23 11:58:58,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:58:58,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {887#true} assume !(~a~0 < 100000); {887#true} is VALID [2018-11-23 11:58:58,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {887#true} havoc ~i~0;~i~0 := 0; {935#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {935#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:58,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {935#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {942#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:58,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {942#(<= main_~i~0 1)} assume !(~i~0 < 100000); {888#false} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#false} havoc ~x~0;~x~0 := 0; {888#false} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {888#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {888#false} is VALID [2018-11-23 11:58:58,309 INFO L256 TraceCheckUtils]: 19: Hoare triple {888#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {888#false} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:58:58,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#false} assume 0 == ~cond; {888#false} is VALID [2018-11-23 11:58:58,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:58:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:58:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 11:58:58,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:58:58,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:58,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:58,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:58,382 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 11:58:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,713 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 11:58:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:58,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:58:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:58:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:58:58,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-23 11:58:58,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,864 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:58:58,865 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:58:58,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-23 11:58:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:58:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 11:58:58,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:58,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 11:58:58,884 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 11:58:58,885 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 11:58:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,887 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:58:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:58:58,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,888 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 11:58:58,888 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 11:58:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,890 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:58:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:58:58,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:58,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:58:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 11:58:58,894 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-11-23 11:58:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:58,894 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 11:58:58,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:58:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:58:58,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:58,896 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:58,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:58,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash -806191654, now seen corresponding path program 4 times [2018-11-23 11:58:58,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:58:59,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1147#true} is VALID [2018-11-23 11:58:59,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:58:59,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #63#return; {1147#true} is VALID [2018-11-23 11:58:59,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret7 := main(); {1147#true} is VALID [2018-11-23 11:58:59,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1149#(= main_~a~0 0)} is VALID [2018-11-23 11:58:59,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {1149#(= 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; {1149#(= main_~a~0 0)} is VALID [2018-11-23 11:58:59,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1149#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(<= 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; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {1151#(<= 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; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1151#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:59,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(<= 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; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:59,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1153#(<= main_~a~0 4)} is VALID [2018-11-23 11:58:59,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1148#false} is VALID [2018-11-23 11:58:59,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {1148#false} havoc ~i~0;~i~0 := 0; {1148#false} is VALID [2018-11-23 11:58:59,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1148#false} is VALID [2018-11-23 11:58:59,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {1148#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 11:58:59,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1148#false} is VALID [2018-11-23 11:58:59,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {1148#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 11:58:59,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {1148#false} assume !(~i~0 < 100000); {1148#false} is VALID [2018-11-23 11:58:59,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {1148#false} havoc ~x~0;~x~0 := 0; {1148#false} is VALID [2018-11-23 11:58:59,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1148#false} is VALID [2018-11-23 11:58:59,080 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1148#false} is VALID [2018-11-23 11:58:59,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 11:58:59,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 11:58:59,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:58:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:59,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:59,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:59,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:59,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:59,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:59,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:58:59,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1147#true} is VALID [2018-11-23 11:58:59,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:58:59,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #63#return; {1147#true} is VALID [2018-11-23 11:58:59,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret7 := main(); {1147#true} is VALID [2018-11-23 11:58:59,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1172#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:59,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(<= 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; {1172#(<= main_~a~0 0)} is VALID [2018-11-23 11:58:59,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {1172#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(<= 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; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:58:59,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {1151#(<= 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; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:58:59,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {1151#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:59,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(<= 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; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:58:59,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1153#(<= main_~a~0 4)} is VALID [2018-11-23 11:58:59,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1148#false} is VALID [2018-11-23 11:58:59,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {1148#false} havoc ~i~0;~i~0 := 0; {1148#false} is VALID [2018-11-23 11:58:59,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1148#false} is VALID [2018-11-23 11:58:59,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {1148#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 11:58:59,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1148#false} is VALID [2018-11-23 11:58:59,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {1148#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 11:58:59,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {1148#false} assume !(~i~0 < 100000); {1148#false} is VALID [2018-11-23 11:58:59,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {1148#false} havoc ~x~0;~x~0 := 0; {1148#false} is VALID [2018-11-23 11:58:59,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1148#false} is VALID [2018-11-23 11:58:59,467 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1148#false} is VALID [2018-11-23 11:58:59,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 11:58:59,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 11:58:59,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:58:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:58:59,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:58:59,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:59,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:59,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:59,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:59,531 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-11-23 11:58:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,694 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 11:58:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:59,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:58:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:58:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:58:59,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 11:58:59,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:59,767 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:58:59,767 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:58:59,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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-23 11:58:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:58:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 11:58:59,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:59,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 11:58:59,804 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 11:58:59,804 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 11:58:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,806 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:58:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:58:59,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,807 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 11:58:59,807 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 11:58:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:59,809 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:58:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:58:59,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:59,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:59,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:59,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:58:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 11:58:59,812 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2018-11-23 11:58:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:59,812 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 11:58:59,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:58:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:58:59,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:59,813 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:59,814 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:59,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1775089928, now seen corresponding path program 5 times [2018-11-23 11:58:59,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1429#true} is VALID [2018-11-23 11:59:00,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {1429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1429#true} is VALID [2018-11-23 11:59:00,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2018-11-23 11:59:00,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #63#return; {1429#true} is VALID [2018-11-23 11:59:00,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret7 := main(); {1429#true} is VALID [2018-11-23 11:59:00,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {1429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1431#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#(= 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; {1431#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1432#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {1432#(<= 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; {1432#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {1432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1433#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {1433#(<= 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; {1433#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {1433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1434#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {1434#(<= 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; {1434#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {1434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1435#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:00,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {1435#(<= 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; {1435#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:00,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1436#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:00,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {1436#(<= main_~a~0 5)} assume !(~a~0 < 100000); {1430#false} is VALID [2018-11-23 11:59:00,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {1430#false} havoc ~i~0;~i~0 := 0; {1430#false} is VALID [2018-11-23 11:59:00,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1430#false} is VALID [2018-11-23 11:59:00,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {1430#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1430#false} is VALID [2018-11-23 11:59:00,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1430#false} is VALID [2018-11-23 11:59:00,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {1430#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1430#false} is VALID [2018-11-23 11:59:00,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {1430#false} assume !(~i~0 < 100000); {1430#false} is VALID [2018-11-23 11:59:00,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#false} havoc ~x~0;~x~0 := 0; {1430#false} is VALID [2018-11-23 11:59:00,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {1430#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1430#false} is VALID [2018-11-23 11:59:00,037 INFO L256 TraceCheckUtils]: 25: Hoare triple {1430#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1430#false} is VALID [2018-11-23 11:59:00,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {1430#false} ~cond := #in~cond; {1430#false} is VALID [2018-11-23 11:59:00,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {1430#false} assume 0 == ~cond; {1430#false} is VALID [2018-11-23 11:59:00,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2018-11-23 11:59:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:59:00,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:00,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:00,099 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:00,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:00,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1429#true} is VALID [2018-11-23 11:59:00,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {1429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1429#true} is VALID [2018-11-23 11:59:00,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2018-11-23 11:59:00,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #63#return; {1429#true} is VALID [2018-11-23 11:59:00,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret7 := main(); {1429#true} is VALID [2018-11-23 11:59:00,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {1429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1429#true} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {1429#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; {1429#true} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {1429#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; {1429#true} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:59:00,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {1429#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; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {1429#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; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {1429#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; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:59:00,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {1429#true} assume !(~a~0 < 100000); {1429#true} is VALID [2018-11-23 11:59:00,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {1429#true} havoc ~i~0;~i~0 := 0; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:00,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {1491#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:00,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {1491#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1498#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1498#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:00,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {1498#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1505#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {1505#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1430#false} is VALID [2018-11-23 11:59:00,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#false} havoc ~x~0;~x~0 := 0; {1430#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {1430#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1430#false} is VALID [2018-11-23 11:59:00,233 INFO L256 TraceCheckUtils]: 25: Hoare triple {1430#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1430#false} is VALID [2018-11-23 11:59:00,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {1430#false} ~cond := #in~cond; {1430#false} is VALID [2018-11-23 11:59:00,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {1430#false} assume 0 == ~cond; {1430#false} is VALID [2018-11-23 11:59:00,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2018-11-23 11:59:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:00,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:00,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 11:59:00,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:59:00,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:00,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:00,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:00,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:00,324 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2018-11-23 11:59:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,622 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-23 11:59:00,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:00,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:59:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2018-11-23 11:59:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2018-11-23 11:59:00,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 59 transitions. [2018-11-23 11:59:00,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,789 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:59:00,789 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:59:00,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:59:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 11:59:00,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:00,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-23 11:59:00,812 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-23 11:59:00,812 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-23 11:59:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,815 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:59:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:59:00,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,816 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-23 11:59:00,816 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-23 11:59:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,818 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:59:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:59:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:00,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 11:59:00,821 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 29 [2018-11-23 11:59:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:00,821 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 11:59:00,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:59:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:59:00,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,822 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:00,823 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1969191540, now seen corresponding path program 6 times [2018-11-23 11:59:00,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:00,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {1743#true} call ULTIMATE.init(); {1743#true} is VALID [2018-11-23 11:59:00,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {1743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1743#true} is VALID [2018-11-23 11:59:00,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {1743#true} assume true; {1743#true} is VALID [2018-11-23 11:59:00,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1743#true} {1743#true} #63#return; {1743#true} is VALID [2018-11-23 11:59:00,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {1743#true} call #t~ret7 := main(); {1743#true} is VALID [2018-11-23 11:59:00,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {1743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1745#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {1745#(= 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; {1745#(= main_~a~0 0)} is VALID [2018-11-23 11:59:00,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {1745#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1746#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {1746#(<= 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; {1746#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:00,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {1746#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1747#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {1747#(<= 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; {1747#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:00,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {1747#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1748#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:00,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {1748#(<= 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; {1748#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:01,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {1748#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1749#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:01,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(<= 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; {1749#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:01,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {1749#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1750#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:01,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {1750#(<= 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; {1750#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:01,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {1750#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1751#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:01,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {1751#(<= main_~a~0 6)} assume !(~a~0 < 100000); {1744#false} is VALID [2018-11-23 11:59:01,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {1744#false} havoc ~i~0;~i~0 := 0; {1744#false} is VALID [2018-11-23 11:59:01,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1744#false} is VALID [2018-11-23 11:59:01,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {1744#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1744#false} is VALID [2018-11-23 11:59:01,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1744#false} is VALID [2018-11-23 11:59:01,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {1744#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1744#false} is VALID [2018-11-23 11:59:01,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1744#false} is VALID [2018-11-23 11:59:01,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {1744#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1744#false} is VALID [2018-11-23 11:59:01,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {1744#false} assume !(~i~0 < 100000); {1744#false} is VALID [2018-11-23 11:59:01,040 INFO L273 TraceCheckUtils]: 27: Hoare triple {1744#false} havoc ~x~0;~x~0 := 0; {1744#false} is VALID [2018-11-23 11:59:01,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {1744#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1744#false} is VALID [2018-11-23 11:59:01,041 INFO L256 TraceCheckUtils]: 29: Hoare triple {1744#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1744#false} is VALID [2018-11-23 11:59:01,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#false} ~cond := #in~cond; {1744#false} is VALID [2018-11-23 11:59:01,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {1744#false} assume 0 == ~cond; {1744#false} is VALID [2018-11-23 11:59:01,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {1744#false} assume !false; {1744#false} is VALID [2018-11-23 11:59:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:59:01,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:01,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:01,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:01,133 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:01,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:01,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {1743#true} call ULTIMATE.init(); {1743#true} is VALID [2018-11-23 11:59:01,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {1743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1743#true} is VALID [2018-11-23 11:59:01,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {1743#true} assume true; {1743#true} is VALID [2018-11-23 11:59:01,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1743#true} {1743#true} #63#return; {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {1743#true} call #t~ret7 := main(); {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {1743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {1743#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; {1743#true} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {1743#true} assume !(~a~0 < 100000); {1743#true} is VALID [2018-11-23 11:59:01,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {1743#true} havoc ~i~0;~i~0 := 0; {1812#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:01,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {1812#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1812#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:01,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {1812#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1819#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {1819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1819#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:01,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {1819#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1826#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {1826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1826#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {1826#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1833#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {1833#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1744#false} is VALID [2018-11-23 11:59:01,295 INFO L273 TraceCheckUtils]: 27: Hoare triple {1744#false} havoc ~x~0;~x~0 := 0; {1744#false} is VALID [2018-11-23 11:59:01,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {1744#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1744#false} is VALID [2018-11-23 11:59:01,296 INFO L256 TraceCheckUtils]: 29: Hoare triple {1744#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1744#false} is VALID [2018-11-23 11:59:01,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#false} ~cond := #in~cond; {1744#false} is VALID [2018-11-23 11:59:01,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {1744#false} assume 0 == ~cond; {1744#false} is VALID [2018-11-23 11:59:01,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {1744#false} assume !false; {1744#false} is VALID [2018-11-23 11:59:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:59:01,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:59:01,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 11:59:01,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:59:01,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:01,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:59:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:59:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:01,432 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 13 states. [2018-11-23 11:59:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,028 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:59:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:02,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 11:59:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 11:59:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 11:59:02,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 63 transitions. [2018-11-23 11:59:02,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,125 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:59:02,125 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:59:02,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:59:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:59:02,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:59:02,180 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:59:02,180 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:59:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,182 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:59:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:59:02,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,182 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:59:02,182 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:59:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,184 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:59:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:59:02,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 11:59:02,186 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2018-11-23 11:59:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,186 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 11:59:02,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:59:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:59:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:59:02,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,187 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:02,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash -811630608, now seen corresponding path program 7 times [2018-11-23 11:59:02,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2018-11-23 11:59:02,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2094#true} is VALID [2018-11-23 11:59:02,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2018-11-23 11:59:02,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #63#return; {2094#true} is VALID [2018-11-23 11:59:02,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret7 := main(); {2094#true} is VALID [2018-11-23 11:59:02,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2096#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {2096#(= 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; {2096#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {2097#(<= 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; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:02,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:02,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {2098#(<= 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; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:02,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:02,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(<= 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; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:02,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:02,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {2100#(<= 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; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:02,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:02,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {2101#(<= 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; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:02,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:02,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {2102#(<= 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; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:02,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2103#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:02,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2095#false} is VALID [2018-11-23 11:59:02,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#false} havoc ~i~0;~i~0 := 0; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:02,765 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:02,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:02,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:02,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !(~i~0 < 100000); {2095#false} is VALID [2018-11-23 11:59:02,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#false} havoc ~x~0;~x~0 := 0; {2095#false} is VALID [2018-11-23 11:59:02,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2095#false} is VALID [2018-11-23 11:59:02,767 INFO L256 TraceCheckUtils]: 33: Hoare triple {2095#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2095#false} is VALID [2018-11-23 11:59:02,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2018-11-23 11:59:02,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2018-11-23 11:59:02,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2018-11-23 11:59:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:02,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:02,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:02,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:02,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2018-11-23 11:59:02,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2094#true} is VALID [2018-11-23 11:59:02,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2018-11-23 11:59:02,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #63#return; {2094#true} is VALID [2018-11-23 11:59:02,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret7 := main(); {2094#true} is VALID [2018-11-23 11:59:02,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2122#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:02,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {2122#(<= 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; {2122#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:02,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {2097#(<= 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; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:03,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:03,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {2098#(<= 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; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:03,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:03,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(<= 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; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:03,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:03,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {2100#(<= 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; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:03,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:03,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {2101#(<= 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; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:03,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:03,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2102#(<= 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; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:03,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2103#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2095#false} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#false} havoc ~i~0;~i~0 := 0; {2095#false} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:03,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !(~i~0 < 100000); {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#false} havoc ~x~0;~x~0 := 0; {2095#false} is VALID [2018-11-23 11:59:03,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2095#false} is VALID [2018-11-23 11:59:03,019 INFO L256 TraceCheckUtils]: 33: Hoare triple {2095#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2095#false} is VALID [2018-11-23 11:59:03,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2018-11-23 11:59:03,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2018-11-23 11:59:03,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2018-11-23 11:59:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:03,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:03,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:03,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:59:03,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:03,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:03,116 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-11-23 11:59:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,392 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 11:59:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:03,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:59:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:59:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:59:03,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2018-11-23 11:59:03,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,458 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:59:03,458 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:59:03,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:59:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:59:03,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:03,483 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:03,484 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,485 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 11:59:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 11:59:03,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,486 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:03,486 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,487 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 11:59:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 11:59:03,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 11:59:03,488 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2018-11-23 11:59:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,489 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 11:59:03,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:59:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:59:03,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,490 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:03,490 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 373619598, now seen corresponding path program 8 times [2018-11-23 11:59:03,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {2465#true} call ULTIMATE.init(); {2465#true} is VALID [2018-11-23 11:59:04,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {2465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2465#true} is VALID [2018-11-23 11:59:04,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {2465#true} assume true; {2465#true} is VALID [2018-11-23 11:59:04,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2465#true} {2465#true} #63#return; {2465#true} is VALID [2018-11-23 11:59:04,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {2465#true} call #t~ret7 := main(); {2465#true} is VALID [2018-11-23 11:59:04,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {2465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2467#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {2467#(= 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; {2467#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {2467#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {2468#(<= 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; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {2468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {2469#(<= 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; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {2469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {2470#(<= 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; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {2470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {2471#(<= 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; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {2471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {2472#(<= 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; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {2472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {2473#(<= 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; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {2473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {2474#(<= 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; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {2474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {2475#(<= main_~a~0 8)} assume !(~a~0 < 100000); {2466#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {2466#false} havoc ~i~0;~i~0 := 0; {2466#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {2466#false} assume !(~i~0 < 100000); {2466#false} is VALID [2018-11-23 11:59:04,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#false} havoc ~x~0;~x~0 := 0; {2466#false} is VALID [2018-11-23 11:59:04,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {2466#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2466#false} is VALID [2018-11-23 11:59:04,244 INFO L256 TraceCheckUtils]: 35: Hoare triple {2466#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2466#false} is VALID [2018-11-23 11:59:04,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {2466#false} ~cond := #in~cond; {2466#false} is VALID [2018-11-23 11:59:04,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {2466#false} assume 0 == ~cond; {2466#false} is VALID [2018-11-23 11:59:04,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {2466#false} assume !false; {2466#false} is VALID [2018-11-23 11:59:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:04,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:04,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:04,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {2465#true} call ULTIMATE.init(); {2465#true} is VALID [2018-11-23 11:59:04,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {2465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2465#true} is VALID [2018-11-23 11:59:04,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {2465#true} assume true; {2465#true} is VALID [2018-11-23 11:59:04,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2465#true} {2465#true} #63#return; {2465#true} is VALID [2018-11-23 11:59:04,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {2465#true} call #t~ret7 := main(); {2465#true} is VALID [2018-11-23 11:59:04,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {2465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2494#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {2494#(<= 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; {2494#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {2494#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {2468#(<= 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; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {2468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {2469#(<= 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; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:04,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {2469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {2470#(<= 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; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:04,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {2470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {2471#(<= 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; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:04,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {2471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {2472#(<= 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; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:04,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {2472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {2473#(<= 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; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:04,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {2473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {2474#(<= 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; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:04,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {2474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:04,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {2475#(<= main_~a~0 8)} assume !(~a~0 < 100000); {2466#false} is VALID [2018-11-23 11:59:04,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {2466#false} havoc ~i~0;~i~0 := 0; {2466#false} is VALID [2018-11-23 11:59:04,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2466#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {2466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2466#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {2466#false} assume !(~i~0 < 100000); {2466#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#false} havoc ~x~0;~x~0 := 0; {2466#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {2466#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2466#false} is VALID [2018-11-23 11:59:04,426 INFO L256 TraceCheckUtils]: 35: Hoare triple {2466#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2466#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {2466#false} ~cond := #in~cond; {2466#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {2466#false} assume 0 == ~cond; {2466#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {2466#false} assume !false; {2466#false} is VALID [2018-11-23 11:59:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:04,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:04,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:59:04,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:04,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:04,483 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-23 11:59:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,991 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 11:59:04,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:04,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:59:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:59:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:59:04,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2018-11-23 11:59:05,056 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-23 11:59:05,058 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:59:05,058 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:59:05,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:59:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 11:59:05,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:05,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:05,101 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:05,101 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 11:59:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,102 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:59:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:59:05,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,103 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 11:59:05,103 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 11:59:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,104 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:59:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:59:05,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:05,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:59:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 11:59:05,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2018-11-23 11:59:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:05,106 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 11:59:05,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:59:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:59:05,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,106 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:05,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1232734124, now seen corresponding path program 9 times [2018-11-23 11:59:05,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {2853#true} call ULTIMATE.init(); {2853#true} is VALID [2018-11-23 11:59:05,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {2853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2853#true} is VALID [2018-11-23 11:59:05,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {2853#true} assume true; {2853#true} is VALID [2018-11-23 11:59:05,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2853#true} {2853#true} #63#return; {2853#true} is VALID [2018-11-23 11:59:05,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {2853#true} call #t~ret7 := main(); {2853#true} is VALID [2018-11-23 11:59:05,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {2853#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2855#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {2855#(= 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; {2855#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {2855#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2856#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {2856#(<= 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; {2856#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {2856#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2857#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {2857#(<= 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; {2857#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {2857#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2858#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {2858#(<= 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; {2858#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:05,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {2858#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2859#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {2859#(<= 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; {2859#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:05,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {2859#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2860#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {2860#(<= 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; {2860#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:05,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {2860#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2861#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {2861#(<= 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; {2861#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:05,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {2861#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2862#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {2862#(<= 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; {2862#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:05,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {2862#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2863#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:05,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {2863#(<= 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; {2863#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:05,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {2863#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2864#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:05,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {2864#(<= main_~a~0 9)} assume !(~a~0 < 100000); {2854#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {2854#false} havoc ~i~0;~i~0 := 0; {2854#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2854#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {2854#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2854#false} is VALID [2018-11-23 11:59:05,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2854#false} is VALID [2018-11-23 11:59:05,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {2854#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2854#false} is VALID [2018-11-23 11:59:05,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2854#false} is VALID [2018-11-23 11:59:05,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {2854#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2854#false} is VALID [2018-11-23 11:59:05,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2854#false} is VALID [2018-11-23 11:59:05,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {2854#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2854#false} is VALID [2018-11-23 11:59:05,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {2854#false} assume !(~i~0 < 100000); {2854#false} is VALID [2018-11-23 11:59:05,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {2854#false} havoc ~x~0;~x~0 := 0; {2854#false} is VALID [2018-11-23 11:59:05,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {2854#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2854#false} is VALID [2018-11-23 11:59:05,323 INFO L256 TraceCheckUtils]: 37: Hoare triple {2854#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2854#false} is VALID [2018-11-23 11:59:05,323 INFO L273 TraceCheckUtils]: 38: Hoare triple {2854#false} ~cond := #in~cond; {2854#false} is VALID [2018-11-23 11:59:05,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {2854#false} assume 0 == ~cond; {2854#false} is VALID [2018-11-23 11:59:05,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {2854#false} assume !false; {2854#false} is VALID [2018-11-23 11:59:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:59:05,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:05,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:05,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:59:05,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {2853#true} call ULTIMATE.init(); {2853#true} is VALID [2018-11-23 11:59:05,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {2853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2853#true} is VALID [2018-11-23 11:59:05,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {2853#true} assume true; {2853#true} is VALID [2018-11-23 11:59:05,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2853#true} {2853#true} #63#return; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {2853#true} call #t~ret7 := main(); {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {2853#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {2853#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; {2853#true} is VALID [2018-11-23 11:59:05,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:59:05,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {2853#true} assume !(~a~0 < 100000); {2853#true} is VALID [2018-11-23 11:59:05,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {2853#true} havoc ~i~0;~i~0 := 0; {2943#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:05,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {2943#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2943#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:05,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {2943#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2950#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {2950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2950#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:05,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {2950#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {2957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {2957#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2964#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {2964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2964#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {2964#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2971#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {2971#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {2854#false} havoc ~x~0;~x~0 := 0; {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {2854#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L256 TraceCheckUtils]: 37: Hoare triple {2854#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {2854#false} ~cond := #in~cond; {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {2854#false} assume 0 == ~cond; {2854#false} is VALID [2018-11-23 11:59:05,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {2854#false} assume !false; {2854#false} is VALID [2018-11-23 11:59:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 11:59:05,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:59:05,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:59:05,597 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-23 11:59:05,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:59:05,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:59:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:05,598 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2018-11-23 11:59:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,164 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-23 11:59:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:06,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:59:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 11:59:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 11:59:06,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 71 transitions. [2018-11-23 11:59:06,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,300 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:59:06,300 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:59:06,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:59:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 11:59:06,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 11:59:06,320 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 11:59:06,320 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 11:59:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,322 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:59:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:59:06,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,322 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 11:59:06,322 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 11:59:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,323 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:59:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:59:06,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 11:59:06,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 41 [2018-11-23 11:59:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,325 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 11:59:06,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:59:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 11:59:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:59:06,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,326 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:06,327 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash 274047272, now seen corresponding path program 10 times [2018-11-23 11:59:06,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-23 11:59:06,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3275#true} is VALID [2018-11-23 11:59:06,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-23 11:59:06,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #63#return; {3275#true} is VALID [2018-11-23 11:59:06,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret7 := main(); {3275#true} is VALID [2018-11-23 11:59:06,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3277#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {3277#(= 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; {3277#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {3277#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#(<= 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; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {3279#(<= 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; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {3279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {3280#(<= 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; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {3280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:06,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {3281#(<= 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; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:06,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:06,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= 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; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:06,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {3282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:06,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {3283#(<= 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; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:06,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:06,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= 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; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:06,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:06,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#(<= 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; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:06,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:06,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {3286#(<= 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; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:06,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {3286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:06,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {3287#(<= main_~a~0 10)} assume !(~a~0 < 100000); {3276#false} is VALID [2018-11-23 11:59:06,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {3276#false} havoc ~i~0;~i~0 := 0; {3276#false} is VALID [2018-11-23 11:59:06,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,608 INFO L273 TraceCheckUtils]: 37: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {3276#false} assume !(~i~0 < 100000); {3276#false} is VALID [2018-11-23 11:59:06,609 INFO L273 TraceCheckUtils]: 39: Hoare triple {3276#false} havoc ~x~0;~x~0 := 0; {3276#false} is VALID [2018-11-23 11:59:06,609 INFO L273 TraceCheckUtils]: 40: Hoare triple {3276#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3276#false} is VALID [2018-11-23 11:59:06,609 INFO L256 TraceCheckUtils]: 41: Hoare triple {3276#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3276#false} is VALID [2018-11-23 11:59:06,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-23 11:59:06,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {3276#false} assume 0 == ~cond; {3276#false} is VALID [2018-11-23 11:59:06,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-23 11:59:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:06,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:06,611 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-23 11:59:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:06,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:06,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:06,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-23 11:59:06,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3275#true} is VALID [2018-11-23 11:59:06,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-23 11:59:06,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #63#return; {3275#true} is VALID [2018-11-23 11:59:06,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret7 := main(); {3275#true} is VALID [2018-11-23 11:59:06,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3306#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:06,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {3306#(<= 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; {3306#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:06,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {3306#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#(<= 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; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {3279#(<= 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; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {3279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {3280#(<= 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; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {3280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:06,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {3281#(<= 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; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:06,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:06,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= 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; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:06,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {3282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:06,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {3283#(<= 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; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:06,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:06,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= 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; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:06,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:06,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#(<= 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; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:06,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:06,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {3286#(<= 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; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:06,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {3286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:06,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {3287#(<= main_~a~0 10)} assume !(~a~0 < 100000); {3276#false} is VALID [2018-11-23 11:59:06,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {3276#false} havoc ~i~0;~i~0 := 0; {3276#false} is VALID [2018-11-23 11:59:06,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3276#false} is VALID [2018-11-23 11:59:06,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {3276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3276#false} is VALID [2018-11-23 11:59:06,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {3276#false} assume !(~i~0 < 100000); {3276#false} is VALID [2018-11-23 11:59:06,837 INFO L273 TraceCheckUtils]: 39: Hoare triple {3276#false} havoc ~x~0;~x~0 := 0; {3276#false} is VALID [2018-11-23 11:59:06,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {3276#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3276#false} is VALID [2018-11-23 11:59:06,838 INFO L256 TraceCheckUtils]: 41: Hoare triple {3276#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3276#false} is VALID [2018-11-23 11:59:06,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-23 11:59:06,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {3276#false} assume 0 == ~cond; {3276#false} is VALID [2018-11-23 11:59:06,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-23 11:59:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:59:06,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:59:06,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:06,914 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-23 11:59:06,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:06,915 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2018-11-23 11:59:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,167 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 11:59:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:07,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:59:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2018-11-23 11:59:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2018-11-23 11:59:07,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 62 transitions. [2018-11-23 11:59:07,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,229 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:59:07,229 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:59:07,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:59:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 11:59:07,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:07,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:07,250 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:07,251 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 11:59:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,252 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 11:59:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 11:59:07,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,253 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 11:59:07,253 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 11:59:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,254 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 11:59:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 11:59:07,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:07,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:59:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 11:59:07,256 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2018-11-23 11:59:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:07,256 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 11:59:07,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:59:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:59:07,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:07,257 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:07,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:07,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843590, now seen corresponding path program 11 times [2018-11-23 11:59:07,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:07,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 11:59:07,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3716#true} is VALID [2018-11-23 11:59:07,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 11:59:07,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3716#true} {3716#true} #63#return; {3716#true} is VALID [2018-11-23 11:59:07,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {3716#true} call #t~ret7 := main(); {3716#true} is VALID [2018-11-23 11:59:07,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {3716#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3718#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {3718#(= 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; {3718#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {3718#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3719#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {3719#(<= 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; {3719#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {3719#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3720#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {3720#(<= 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; {3720#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {3720#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3721#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {3721#(<= 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; {3721#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {3721#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3722#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {3722#(<= 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; {3722#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {3722#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3723#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:07,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {3723#(<= 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; {3723#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:07,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {3723#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3724#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:07,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {3724#(<= 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; {3724#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:07,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {3724#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3725#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:07,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {3725#(<= 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; {3725#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:07,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {3725#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3726#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:07,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {3726#(<= 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; {3726#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:07,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {3726#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3727#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:07,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {3727#(<= 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; {3727#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:07,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {3727#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3728#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:07,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {3728#(<= 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; {3728#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:07,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {3728#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3729#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:07,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {3729#(<= main_~a~0 11)} assume !(~a~0 < 100000); {3717#false} is VALID [2018-11-23 11:59:07,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {3717#false} havoc ~i~0;~i~0 := 0; {3717#false} is VALID [2018-11-23 11:59:07,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3717#false} is VALID [2018-11-23 11:59:07,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {3717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3717#false} is VALID [2018-11-23 11:59:07,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3717#false} is VALID [2018-11-23 11:59:07,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {3717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3717#false} is VALID [2018-11-23 11:59:07,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3717#false} is VALID [2018-11-23 11:59:07,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {3717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3717#false} is VALID [2018-11-23 11:59:07,589 INFO L273 TraceCheckUtils]: 36: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3717#false} is VALID [2018-11-23 11:59:07,589 INFO L273 TraceCheckUtils]: 37: Hoare triple {3717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3717#false} is VALID [2018-11-23 11:59:07,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3717#false} is VALID [2018-11-23 11:59:07,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {3717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3717#false} is VALID [2018-11-23 11:59:07,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {3717#false} assume !(~i~0 < 100000); {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {3717#false} havoc ~x~0;~x~0 := 0; {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {3717#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L256 TraceCheckUtils]: 43: Hoare triple {3717#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L273 TraceCheckUtils]: 44: Hoare triple {3717#false} ~cond := #in~cond; {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L273 TraceCheckUtils]: 45: Hoare triple {3717#false} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 11:59:07,590 INFO L273 TraceCheckUtils]: 46: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 11:59:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:07,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,592 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-23 11:59:07,601 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:08,002 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:59:08,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:08,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:08,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 11:59:08,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3716#true} is VALID [2018-11-23 11:59:08,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 11:59:08,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3716#true} {3716#true} #63#return; {3716#true} is VALID [2018-11-23 11:59:08,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {3716#true} call #t~ret7 := main(); {3716#true} is VALID [2018-11-23 11:59:08,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {3716#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3716#true} is VALID [2018-11-23 11:59:08,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {3716#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; {3716#true} is VALID [2018-11-23 11:59:08,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:59:08,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {3716#true} assume !(~a~0 < 100000); {3716#true} is VALID [2018-11-23 11:59:08,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {3716#true} havoc ~i~0;~i~0 := 0; {3820#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:08,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {3820#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3820#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:08,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {3820#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3827#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:08,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {3827#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3827#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:08,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {3827#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3834#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:08,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {3834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3834#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:08,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {3834#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3841#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:08,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {3841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3841#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:08,290 INFO L273 TraceCheckUtils]: 37: Hoare triple {3841#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3848#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:08,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3848#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:08,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3855#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:08,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {3855#(<= main_~i~0 5)} assume !(~i~0 < 100000); {3717#false} is VALID [2018-11-23 11:59:08,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {3717#false} havoc ~x~0;~x~0 := 0; {3717#false} is VALID [2018-11-23 11:59:08,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {3717#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3717#false} is VALID [2018-11-23 11:59:08,293 INFO L256 TraceCheckUtils]: 43: Hoare triple {3717#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3717#false} is VALID [2018-11-23 11:59:08,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {3717#false} ~cond := #in~cond; {3717#false} is VALID [2018-11-23 11:59:08,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {3717#false} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 11:59:08,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 11:59:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:59:08,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:08,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 11:59:08,318 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:59:08,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:08,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:59:08,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:59:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:59:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:08,397 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-11-23 11:59:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,816 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 11:59:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:08,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:59:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 11:59:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 11:59:08,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2018-11-23 11:59:09,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,252 INFO L225 Difference]: With dead ends: 81 [2018-11-23 11:59:09,252 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:59:09,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:59:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 11:59:09,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:09,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:09,281 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:09,281 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 11:59:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,283 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:59:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:59:09,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,285 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 11:59:09,285 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 11:59:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,287 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:59:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:59:09,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:09,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 11:59:09,289 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 47 [2018-11-23 11:59:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:09,289 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 11:59:09,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:59:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:59:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:59:09,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:09,290 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:09,290 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:09,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1228141758, now seen corresponding path program 12 times [2018-11-23 11:59:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-23 11:59:09,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-23 11:59:09,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #63#return; {4192#true} is VALID [2018-11-23 11:59:09,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4194#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {4194#(= 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; {4194#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {4194#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4195#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= 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; {4195#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4196#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= 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; {4196#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4197#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= 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; {4197#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:09,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4198#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= 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; {4198#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:09,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4199#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= 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; {4199#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:09,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4200#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= 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; {4200#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:09,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4201#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= 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; {4201#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:09,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4202#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= 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; {4202#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:09,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4203#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {4203#(<= 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; {4203#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:09,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {4203#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4204#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:09,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {4204#(<= 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; {4204#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:09,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {4204#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4205#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:09,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {4205#(<= 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; {4205#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:09,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {4205#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4206#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:09,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~a~0 12)} assume !(~a~0 < 100000); {4193#false} is VALID [2018-11-23 11:59:09,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} havoc ~i~0;~i~0 := 0; {4193#false} is VALID [2018-11-23 11:59:09,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L256 TraceCheckUtils]: 47: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-23 11:59:09,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-23 11:59:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:59:09,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,661 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-23 11:59:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:10,527 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:59:10,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:10,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-23 11:59:10,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-23 11:59:10,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-23 11:59:10,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #63#return; {4192#true} is VALID [2018-11-23 11:59:10,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2018-11-23 11:59:10,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4192#true} is VALID [2018-11-23 11:59:10,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {4192#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; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:59:10,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {4192#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; {4294#(< main_~a~0 100000)} is VALID [2018-11-23 11:59:10,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {4294#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4298#(<= main_~a~0 100000)} is VALID [2018-11-23 11:59:10,769 INFO L273 TraceCheckUtils]: 30: Hoare triple {4298#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {4192#true} is VALID [2018-11-23 11:59:10,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {4192#true} havoc ~i~0;~i~0 := 0; {4305#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:10,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {4305#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4305#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:10,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {4305#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4312#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {4312#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4312#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {4312#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4319#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {4319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4319#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {4319#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4326#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {4326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4326#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {4326#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4333#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {4333#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4333#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {4333#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4340#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {4340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4340#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {4340#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4347#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {4347#(<= main_~i~0 6)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-23 11:59:10,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-23 11:59:10,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-23 11:59:10,777 INFO L256 TraceCheckUtils]: 47: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4193#false} is VALID [2018-11-23 11:59:10,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-23 11:59:10,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-23 11:59:10,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-23 11:59:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 23 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:59:10,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-23 11:59:10,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-23 11:59:10,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:59:10,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:59:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:59:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:59:10,858 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 24 states. [2018-11-23 11:59:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,507 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:59:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:59:11,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-23 11:59:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 83 transitions. [2018-11-23 11:59:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:59:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 83 transitions. [2018-11-23 11:59:11,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 83 transitions. [2018-11-23 11:59:12,001 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-23 11:59:12,002 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:59:12,003 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:59:12,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:59:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 11:59:12,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:12,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 11:59:12,041 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 11:59:12,041 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 11:59:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,043 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 11:59:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 11:59:12,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,044 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 11:59:12,044 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 11:59:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,046 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 11:59:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 11:59:12,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:12,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:59:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 11:59:12,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 51 [2018-11-23 11:59:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:12,048 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 11:59:12,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:59:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:59:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:59:12,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:12,049 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:12,050 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:12,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1939154468, now seen corresponding path program 13 times [2018-11-23 11:59:12,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:12,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {4728#true} call ULTIMATE.init(); {4728#true} is VALID [2018-11-23 11:59:12,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {4728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4728#true} is VALID [2018-11-23 11:59:12,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {4728#true} assume true; {4728#true} is VALID [2018-11-23 11:59:12,913 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4728#true} {4728#true} #63#return; {4728#true} is VALID [2018-11-23 11:59:12,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {4728#true} call #t~ret7 := main(); {4728#true} is VALID [2018-11-23 11:59:12,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {4728#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4730#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {4730#(= 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; {4730#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {4730#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4731#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {4731#(<= 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; {4731#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {4731#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4732#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {4732#(<= 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; {4732#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {4732#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4733#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {4733#(<= 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; {4733#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {4733#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4734#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {4734#(<= 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; {4734#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {4734#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4735#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {4735#(<= 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; {4735#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {4735#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4736#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {4736#(<= 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; {4736#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {4736#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4737#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {4737#(<= 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; {4737#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {4737#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4738#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:12,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {4738#(<= 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; {4738#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:12,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {4738#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4739#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:12,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {4739#(<= 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; {4739#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:12,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {4739#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4740#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:12,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {4740#(<= 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; {4740#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:12,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {4740#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4741#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:12,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {4741#(<= 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; {4741#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:12,949 INFO L273 TraceCheckUtils]: 29: Hoare triple {4741#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4742#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:12,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {4742#(<= 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; {4742#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:12,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {4742#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4743#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:12,951 INFO L273 TraceCheckUtils]: 32: Hoare triple {4743#(<= 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; {4743#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:12,951 INFO L273 TraceCheckUtils]: 33: Hoare triple {4743#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4744#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:12,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {4744#(<= main_~a~0 14)} assume !(~a~0 < 100000); {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {4729#false} havoc ~i~0;~i~0 := 0; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 36: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:12,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:12,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {4729#false} assume !(~i~0 < 100000); {4729#false} is VALID [2018-11-23 11:59:12,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {4729#false} havoc ~x~0;~x~0 := 0; {4729#false} is VALID [2018-11-23 11:59:12,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {4729#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4729#false} is VALID [2018-11-23 11:59:12,955 INFO L256 TraceCheckUtils]: 53: Hoare triple {4729#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4729#false} is VALID [2018-11-23 11:59:12,955 INFO L273 TraceCheckUtils]: 54: Hoare triple {4729#false} ~cond := #in~cond; {4729#false} is VALID [2018-11-23 11:59:12,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {4729#false} assume 0 == ~cond; {4729#false} is VALID [2018-11-23 11:59:12,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {4729#false} assume !false; {4729#false} is VALID [2018-11-23 11:59:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:59:12,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,957 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-23 11:59:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:13,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {4728#true} call ULTIMATE.init(); {4728#true} is VALID [2018-11-23 11:59:13,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {4728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4728#true} is VALID [2018-11-23 11:59:13,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {4728#true} assume true; {4728#true} is VALID [2018-11-23 11:59:13,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4728#true} {4728#true} #63#return; {4728#true} is VALID [2018-11-23 11:59:13,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {4728#true} call #t~ret7 := main(); {4728#true} is VALID [2018-11-23 11:59:13,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {4728#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4763#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:13,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {4763#(<= 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; {4763#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:13,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {4763#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4731#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {4731#(<= 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; {4731#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {4731#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4732#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {4732#(<= 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; {4732#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {4732#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4733#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {4733#(<= 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; {4733#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {4733#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4734#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {4734#(<= 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; {4734#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {4734#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4735#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {4735#(<= 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; {4735#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {4735#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4736#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {4736#(<= 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; {4736#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {4736#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4737#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:13,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {4737#(<= 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; {4737#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:13,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {4737#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4738#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:13,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {4738#(<= 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; {4738#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:13,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {4738#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4739#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:13,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {4739#(<= 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; {4739#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:13,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {4739#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4740#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:13,370 INFO L273 TraceCheckUtils]: 26: Hoare triple {4740#(<= 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; {4740#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:13,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {4740#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4741#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:13,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {4741#(<= 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; {4741#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:13,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {4741#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4742#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:13,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {4742#(<= 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; {4742#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:13,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {4742#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4743#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:13,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {4743#(<= 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; {4743#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:13,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {4743#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4744#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:13,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {4744#(<= main_~a~0 14)} assume !(~a~0 < 100000); {4729#false} is VALID [2018-11-23 11:59:13,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {4729#false} havoc ~i~0;~i~0 := 0; {4729#false} is VALID [2018-11-23 11:59:13,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 44: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,388 INFO L273 TraceCheckUtils]: 45: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 46: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {4729#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {4729#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 50: Hoare triple {4729#false} assume !(~i~0 < 100000); {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 51: Hoare triple {4729#false} havoc ~x~0;~x~0 := 0; {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L273 TraceCheckUtils]: 52: Hoare triple {4729#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4729#false} is VALID [2018-11-23 11:59:13,389 INFO L256 TraceCheckUtils]: 53: Hoare triple {4729#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4729#false} is VALID [2018-11-23 11:59:13,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {4729#false} ~cond := #in~cond; {4729#false} is VALID [2018-11-23 11:59:13,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {4729#false} assume 0 == ~cond; {4729#false} is VALID [2018-11-23 11:59:13,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {4729#false} assume !false; {4729#false} is VALID [2018-11-23 11:59:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:59:13,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:59:13,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 11:59:13,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:59:13,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:59:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:59:13,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:13,470 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 18 states. [2018-11-23 11:59:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,929 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:59:13,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:13,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 11:59:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 11:59:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:59:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 11:59:13,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2018-11-23 11:59:13,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:14,001 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:59:14,001 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:59:14,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:59:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 11:59:14,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:14,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 11:59:14,039 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 11:59:14,039 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 11:59:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,041 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 11:59:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 11:59:14,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,042 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 11:59:14,042 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 11:59:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,044 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 11:59:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 11:59:14,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:14,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:14,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:14,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:59:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 11:59:14,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2018-11-23 11:59:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:14,047 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 11:59:14,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:59:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 11:59:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:59:14,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:14,048 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:14,048 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:14,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1391221370, now seen corresponding path program 14 times [2018-11-23 11:59:14,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {5275#true} call ULTIMATE.init(); {5275#true} is VALID [2018-11-23 11:59:14,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {5275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5275#true} is VALID [2018-11-23 11:59:14,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {5275#true} assume true; {5275#true} is VALID [2018-11-23 11:59:14,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5275#true} {5275#true} #63#return; {5275#true} is VALID [2018-11-23 11:59:14,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {5275#true} call #t~ret7 := main(); {5275#true} is VALID [2018-11-23 11:59:14,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {5275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5277#(= main_~a~0 0)} is VALID [2018-11-23 11:59:14,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {5277#(= 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; {5277#(= main_~a~0 0)} is VALID [2018-11-23 11:59:14,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {5277#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {5278#(<= 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; {5278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {5278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {5279#(<= 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; {5279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {5279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {5280#(<= 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; {5280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {5280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {5281#(<= 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; {5281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {5281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {5282#(<= 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; {5282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {5282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {5283#(<= 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; {5283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {5283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:14,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {5284#(<= 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; {5284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {5284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:14,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {5285#(<= 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; {5285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:14,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {5285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {5286#(<= 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; {5286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:14,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {5286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:14,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {5287#(<= 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; {5287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {5287#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5288#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:14,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {5288#(<= 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; {5288#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:14,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {5288#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5289#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:14,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {5289#(<= 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; {5289#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:14,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {5289#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5290#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:14,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {5290#(<= 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; {5290#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:14,894 INFO L273 TraceCheckUtils]: 33: Hoare triple {5290#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5291#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:14,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {5291#(<= 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; {5291#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:14,895 INFO L273 TraceCheckUtils]: 35: Hoare triple {5291#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5292#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:14,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {5292#(<= main_~a~0 15)} assume !(~a~0 < 100000); {5276#false} is VALID [2018-11-23 11:59:14,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {5276#false} havoc ~i~0;~i~0 := 0; {5276#false} is VALID [2018-11-23 11:59:14,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,897 INFO L273 TraceCheckUtils]: 41: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,898 INFO L273 TraceCheckUtils]: 47: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,898 INFO L273 TraceCheckUtils]: 49: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:14,899 INFO L273 TraceCheckUtils]: 51: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:14,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {5276#false} assume !(~i~0 < 100000); {5276#false} is VALID [2018-11-23 11:59:14,899 INFO L273 TraceCheckUtils]: 53: Hoare triple {5276#false} havoc ~x~0;~x~0 := 0; {5276#false} is VALID [2018-11-23 11:59:14,899 INFO L273 TraceCheckUtils]: 54: Hoare triple {5276#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5276#false} is VALID [2018-11-23 11:59:14,900 INFO L256 TraceCheckUtils]: 55: Hoare triple {5276#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {5276#false} is VALID [2018-11-23 11:59:14,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {5276#false} ~cond := #in~cond; {5276#false} is VALID [2018-11-23 11:59:14,900 INFO L273 TraceCheckUtils]: 57: Hoare triple {5276#false} assume 0 == ~cond; {5276#false} is VALID [2018-11-23 11:59:14,900 INFO L273 TraceCheckUtils]: 58: Hoare triple {5276#false} assume !false; {5276#false} is VALID [2018-11-23 11:59:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:59:14,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:14,903 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-23 11:59:14,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:14,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:14,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:15,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {5275#true} call ULTIMATE.init(); {5275#true} is VALID [2018-11-23 11:59:15,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {5275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5275#true} is VALID [2018-11-23 11:59:15,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {5275#true} assume true; {5275#true} is VALID [2018-11-23 11:59:15,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5275#true} {5275#true} #63#return; {5275#true} is VALID [2018-11-23 11:59:15,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {5275#true} call #t~ret7 := main(); {5275#true} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {5275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5311#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:15,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {5311#(<= 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; {5311#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {5311#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {5278#(<= 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; {5278#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {5278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {5279#(<= 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; {5279#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {5279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {5280#(<= 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; {5280#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {5280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {5281#(<= 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; {5281#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:15,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {5281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {5282#(<= 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; {5282#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:15,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {5282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {5283#(<= 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; {5283#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:15,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {5283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:15,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {5284#(<= 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; {5284#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:15,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {5284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:15,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {5285#(<= 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; {5285#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:15,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {5285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:15,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {5286#(<= 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; {5286#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:15,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {5286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:15,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {5287#(<= 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; {5287#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:15,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {5287#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5288#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:15,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {5288#(<= 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; {5288#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:15,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {5288#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5289#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:15,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {5289#(<= 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; {5289#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:15,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {5289#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5290#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:15,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {5290#(<= 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; {5290#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:15,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {5290#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5291#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:15,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {5291#(<= 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; {5291#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:15,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {5291#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5292#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:15,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {5292#(<= main_~a~0 15)} assume !(~a~0 < 100000); {5276#false} is VALID [2018-11-23 11:59:15,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {5276#false} havoc ~i~0;~i~0 := 0; {5276#false} is VALID [2018-11-23 11:59:15,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,138 INFO L273 TraceCheckUtils]: 46: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,138 INFO L273 TraceCheckUtils]: 47: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {5276#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5276#false} is VALID [2018-11-23 11:59:15,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {5276#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5276#false} is VALID [2018-11-23 11:59:15,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {5276#false} assume !(~i~0 < 100000); {5276#false} is VALID [2018-11-23 11:59:15,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {5276#false} havoc ~x~0;~x~0 := 0; {5276#false} is VALID [2018-11-23 11:59:15,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {5276#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5276#false} is VALID [2018-11-23 11:59:15,140 INFO L256 TraceCheckUtils]: 55: Hoare triple {5276#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {5276#false} is VALID [2018-11-23 11:59:15,140 INFO L273 TraceCheckUtils]: 56: Hoare triple {5276#false} ~cond := #in~cond; {5276#false} is VALID [2018-11-23 11:59:15,140 INFO L273 TraceCheckUtils]: 57: Hoare triple {5276#false} assume 0 == ~cond; {5276#false} is VALID [2018-11-23 11:59:15,141 INFO L273 TraceCheckUtils]: 58: Hoare triple {5276#false} assume !false; {5276#false} is VALID [2018-11-23 11:59:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:59:15,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:59:15,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-23 11:59:15,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:15,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:59:15,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:59:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:59:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:59:15,214 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 19 states. [2018-11-23 11:59:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,546 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-23 11:59:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:59:15,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-23 11:59:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2018-11-23 11:59:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:59:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2018-11-23 11:59:15,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2018-11-23 11:59:16,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:16,018 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:59:16,018 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:59:16,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:59:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:59:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 11:59:16,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:16,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 11:59:16,464 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 11:59:16,464 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 11:59:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,465 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 11:59:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 11:59:16,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,468 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 11:59:16,468 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 11:59:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,470 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 11:59:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 11:59:16,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:16,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:59:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 11:59:16,473 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2018-11-23 11:59:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:16,473 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 11:59:16,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:59:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 11:59:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:59:16,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:16,474 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:16,474 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:16,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2131766168, now seen corresponding path program 15 times [2018-11-23 11:59:16,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:16,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:17,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {5839#true} call ULTIMATE.init(); {5839#true} is VALID [2018-11-23 11:59:17,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {5839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5839#true} is VALID [2018-11-23 11:59:17,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {5839#true} assume true; {5839#true} is VALID [2018-11-23 11:59:17,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5839#true} {5839#true} #63#return; {5839#true} is VALID [2018-11-23 11:59:17,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {5839#true} call #t~ret7 := main(); {5839#true} is VALID [2018-11-23 11:59:17,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {5839#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5841#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {5841#(= 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; {5841#(= main_~a~0 0)} is VALID [2018-11-23 11:59:17,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {5841#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {5842#(<= 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; {5842#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:17,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {5842#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {5843#(<= 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; {5843#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:17,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {5843#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {5844#(<= 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; {5844#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:17,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {5844#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {5845#(<= 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; {5845#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:17,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {5845#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {5846#(<= 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; {5846#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:17,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {5846#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {5847#(<= 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; {5847#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:17,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {5847#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {5848#(<= 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; {5848#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:17,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {5848#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {5849#(<= 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; {5849#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:17,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {5849#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:17,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {5850#(<= 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; {5850#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:17,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {5850#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:17,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {5851#(<= 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; {5851#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:17,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {5851#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:17,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {5852#(<= 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; {5852#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:17,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {5852#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:17,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {5853#(<= 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; {5853#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:17,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {5853#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:17,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {5854#(<= 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; {5854#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:17,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {5854#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:17,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {5855#(<= 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; {5855#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:17,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {5855#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:17,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {5856#(<= 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; {5856#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:17,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {5856#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {5857#(<= main_~a~0 16)} assume !(~a~0 < 100000); {5840#false} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {5840#false} havoc ~i~0;~i~0 := 0; {5840#false} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,325 INFO L273 TraceCheckUtils]: 51: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {5840#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 53: Hoare triple {5840#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {5840#false} assume !(~i~0 < 100000); {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 55: Hoare triple {5840#false} havoc ~x~0;~x~0 := 0; {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 56: Hoare triple {5840#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L256 TraceCheckUtils]: 57: Hoare triple {5840#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {5840#false} ~cond := #in~cond; {5840#false} is VALID [2018-11-23 11:59:17,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {5840#false} assume 0 == ~cond; {5840#false} is VALID [2018-11-23 11:59:17,327 INFO L273 TraceCheckUtils]: 60: Hoare triple {5840#false} assume !false; {5840#false} is VALID [2018-11-23 11:59:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:59:17,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:17,329 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-23 11:59:17,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:17,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:59:17,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:17,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:17,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {5839#true} call ULTIMATE.init(); {5839#true} is VALID [2018-11-23 11:59:17,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {5839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5839#true} is VALID [2018-11-23 11:59:17,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {5839#true} assume true; {5839#true} is VALID [2018-11-23 11:59:17,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5839#true} {5839#true} #63#return; {5839#true} is VALID [2018-11-23 11:59:17,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {5839#true} call #t~ret7 := main(); {5839#true} is VALID [2018-11-23 11:59:17,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {5839#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5839#true} is VALID [2018-11-23 11:59:17,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {5839#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; {5839#true} is VALID [2018-11-23 11:59:17,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {5839#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5839#true} is VALID [2018-11-23 11:59:17,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {5839#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; {5969#(< main_~a~0 100000)} is VALID [2018-11-23 11:59:17,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {5969#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5973#(<= main_~a~0 100000)} is VALID [2018-11-23 11:59:17,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {5973#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {5839#true} is VALID [2018-11-23 11:59:17,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {5839#true} havoc ~i~0;~i~0 := 0; {5980#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:17,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {5980#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5980#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:17,784 INFO L273 TraceCheckUtils]: 41: Hoare triple {5980#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5987#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:17,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {5987#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5987#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:17,784 INFO L273 TraceCheckUtils]: 43: Hoare triple {5987#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5994#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:17,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {5994#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5994#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:17,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {5994#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6001#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:17,785 INFO L273 TraceCheckUtils]: 46: Hoare triple {6001#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6001#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:17,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {6001#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6008#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:17,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {6008#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6008#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:17,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {6008#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6015#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:17,788 INFO L273 TraceCheckUtils]: 50: Hoare triple {6015#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6015#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:17,788 INFO L273 TraceCheckUtils]: 51: Hoare triple {6015#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6022#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:17,789 INFO L273 TraceCheckUtils]: 52: Hoare triple {6022#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6022#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:17,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {6022#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6029#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:17,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {6029#(<= main_~i~0 7)} assume !(~i~0 < 100000); {5840#false} is VALID [2018-11-23 11:59:17,791 INFO L273 TraceCheckUtils]: 55: Hoare triple {5840#false} havoc ~x~0;~x~0 := 0; {5840#false} is VALID [2018-11-23 11:59:17,791 INFO L273 TraceCheckUtils]: 56: Hoare triple {5840#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5840#false} is VALID [2018-11-23 11:59:17,791 INFO L256 TraceCheckUtils]: 57: Hoare triple {5840#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {5840#false} is VALID [2018-11-23 11:59:17,791 INFO L273 TraceCheckUtils]: 58: Hoare triple {5840#false} ~cond := #in~cond; {5840#false} is VALID [2018-11-23 11:59:17,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {5840#false} assume 0 == ~cond; {5840#false} is VALID [2018-11-23 11:59:17,792 INFO L273 TraceCheckUtils]: 60: Hoare triple {5840#false} assume !false; {5840#false} is VALID [2018-11-23 11:59:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 11:59:17,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:17,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-23 11:59:17,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-11-23 11:59:17,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:17,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:59:17,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:17,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:59:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:59:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:17,880 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 29 states. [2018-11-23 11:59:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,933 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-23 11:59:18,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:18,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-11-23 11:59:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 93 transitions. [2018-11-23 11:59:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 93 transitions. [2018-11-23 11:59:18,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 93 transitions. [2018-11-23 11:59:19,433 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-23 11:59:19,435 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:59:19,435 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:59:19,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:59:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:59:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 11:59:19,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:19,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:19,478 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:19,478 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 11:59:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,480 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 11:59:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 11:59:19,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:19,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:19,481 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 11:59:19,481 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 11:59:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,483 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 11:59:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 11:59:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:19,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:19,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:59:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 11:59:19,485 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 61 [2018-11-23 11:59:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:19,486 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 11:59:19,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:59:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 11:59:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:59:19,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:19,486 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:19,487 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1379189170, now seen corresponding path program 16 times [2018-11-23 11:59:19,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:19,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:20,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 11:59:20,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 11:59:20,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 11:59:20,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #63#return; {6465#true} is VALID [2018-11-23 11:59:20,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret7 := main(); {6465#true} is VALID [2018-11-23 11:59:20,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6467#(= main_~a~0 0)} is VALID [2018-11-23 11:59:20,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {6467#(= 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; {6467#(= main_~a~0 0)} is VALID [2018-11-23 11:59:20,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {6467#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:20,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {6468#(<= 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; {6468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:20,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {6468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:20,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {6469#(<= 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; {6469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:20,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {6469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:20,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {6470#(<= 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; {6470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:20,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {6470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:20,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {6471#(<= 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; {6471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:20,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {6471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:20,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {6472#(<= 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; {6472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:20,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {6472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:20,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {6473#(<= 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; {6473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:20,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {6473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:20,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {6474#(<= 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; {6474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:20,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {6474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:20,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {6475#(<= 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; {6475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:20,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {6475#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6476#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:20,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {6476#(<= 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; {6476#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:20,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {6476#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6477#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:20,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {6477#(<= 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; {6477#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:20,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {6477#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6478#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:20,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {6478#(<= 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; {6478#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:20,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {6478#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6479#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:20,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#(<= 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; {6479#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:20,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6480#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:20,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {6480#(<= 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; {6480#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:20,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {6480#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6481#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:20,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {6481#(<= 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; {6481#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:20,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {6481#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6482#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:20,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {6482#(<= 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; {6482#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:20,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {6482#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6483#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:20,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {6483#(<= 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; {6483#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:20,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {6483#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6484#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:20,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {6484#(<= 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; {6484#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:20,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {6484#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6485#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:20,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {6485#(<= main_~a~0 18)} assume !(~a~0 < 100000); {6466#false} is VALID [2018-11-23 11:59:20,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {6466#false} havoc ~i~0;~i~0 := 0; {6466#false} is VALID [2018-11-23 11:59:20,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 57: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 58: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {6466#false} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 11:59:20,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 11:59:20,542 INFO L273 TraceCheckUtils]: 62: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 11:59:20,542 INFO L256 TraceCheckUtils]: 63: Hoare triple {6466#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {6466#false} is VALID [2018-11-23 11:59:20,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 11:59:20,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 11:59:20,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 11:59:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:20,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:20,545 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-23 11:59:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:20,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:20,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:20,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:20,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 11:59:20,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 11:59:20,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 11:59:20,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #63#return; {6465#true} is VALID [2018-11-23 11:59:20,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret7 := main(); {6465#true} is VALID [2018-11-23 11:59:20,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6504#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:20,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {6504#(<= 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; {6504#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:20,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {6504#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:20,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {6468#(<= 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; {6468#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:20,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {6468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:20,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {6469#(<= 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; {6469#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:20,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {6469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:20,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {6470#(<= 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; {6470#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:20,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {6470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:20,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {6471#(<= 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; {6471#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:20,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {6471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:20,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {6472#(<= 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; {6472#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:20,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {6472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:20,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {6473#(<= 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; {6473#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:20,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {6473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:20,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {6474#(<= 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; {6474#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:20,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {6474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:20,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {6475#(<= 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; {6475#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:20,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {6475#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6476#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:20,845 INFO L273 TraceCheckUtils]: 24: Hoare triple {6476#(<= 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; {6476#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:20,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {6476#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6477#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:20,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {6477#(<= 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; {6477#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:20,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {6477#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6478#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:20,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {6478#(<= 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; {6478#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:20,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {6478#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6479#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:20,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {6479#(<= 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; {6479#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:20,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {6479#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6480#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:20,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {6480#(<= 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; {6480#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:20,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {6480#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6481#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:20,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {6481#(<= 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; {6481#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:20,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {6481#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6482#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:20,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {6482#(<= 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; {6482#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:20,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {6482#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6483#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:20,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {6483#(<= 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; {6483#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:20,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {6483#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6484#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:20,855 INFO L273 TraceCheckUtils]: 40: Hoare triple {6484#(<= 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; {6484#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:20,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {6484#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6485#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:20,857 INFO L273 TraceCheckUtils]: 42: Hoare triple {6485#(<= main_~a~0 18)} assume !(~a~0 < 100000); {6466#false} is VALID [2018-11-23 11:59:20,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {6466#false} havoc ~i~0;~i~0 := 0; {6466#false} is VALID [2018-11-23 11:59:20,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,857 INFO L273 TraceCheckUtils]: 45: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,858 INFO L273 TraceCheckUtils]: 49: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,859 INFO L273 TraceCheckUtils]: 54: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,860 INFO L273 TraceCheckUtils]: 57: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {6466#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6466#false} is VALID [2018-11-23 11:59:20,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {6466#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L273 TraceCheckUtils]: 60: Hoare triple {6466#false} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L256 TraceCheckUtils]: 63: Hoare triple {6466#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 11:59:20,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 11:59:20,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 11:59:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:20,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:20,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:59:20,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 11:59:20,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:20,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:59:20,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:59:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:59:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:59:20,947 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 22 states. [2018-11-23 11:59:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,527 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 11:59:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:59:21,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 11:59:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:59:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2018-11-23 11:59:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:59:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2018-11-23 11:59:21,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 78 transitions. [2018-11-23 11:59:21,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:21,978 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:59:21,978 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:59:21,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:59:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:59:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 11:59:22,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:22,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-23 11:59:22,047 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-23 11:59:22,047 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-23 11:59:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,049 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 11:59:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 11:59:22,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:22,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:22,049 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-23 11:59:22,049 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-23 11:59:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,051 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 11:59:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 11:59:22,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:22,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:22,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:22,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:59:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 11:59:22,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2018-11-23 11:59:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:22,054 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 11:59:22,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:59:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 11:59:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 11:59:22,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:22,055 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:22,055 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -369322800, now seen corresponding path program 17 times [2018-11-23 11:59:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:22,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:22,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:22,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {7099#true} call ULTIMATE.init(); {7099#true} is VALID [2018-11-23 11:59:22,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {7099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7099#true} is VALID [2018-11-23 11:59:22,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {7099#true} assume true; {7099#true} is VALID [2018-11-23 11:59:22,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7099#true} {7099#true} #63#return; {7099#true} is VALID [2018-11-23 11:59:22,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {7099#true} call #t~ret7 := main(); {7099#true} is VALID [2018-11-23 11:59:22,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {7099#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7101#(= main_~a~0 0)} is VALID [2018-11-23 11:59:22,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {7101#(= 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; {7101#(= main_~a~0 0)} is VALID [2018-11-23 11:59:22,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {7101#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7102#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {7102#(<= 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; {7102#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:22,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {7102#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7103#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {7103#(<= 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; {7103#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:22,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {7103#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7104#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {7104#(<= 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; {7104#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:22,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {7104#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7105#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {7105#(<= 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; {7105#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:22,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {7105#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7106#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {7106#(<= 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; {7106#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:22,870 INFO L273 TraceCheckUtils]: 17: Hoare triple {7106#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7107#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {7107#(<= 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; {7107#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:22,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {7107#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7108#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:22,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {7108#(<= 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; {7108#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:22,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {7108#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7109#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:22,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {7109#(<= 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; {7109#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:22,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {7109#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7110#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:22,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {7110#(<= 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; {7110#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:22,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {7110#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7111#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:22,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {7111#(<= 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; {7111#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:22,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {7111#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7112#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:22,877 INFO L273 TraceCheckUtils]: 28: Hoare triple {7112#(<= 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; {7112#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:22,878 INFO L273 TraceCheckUtils]: 29: Hoare triple {7112#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7113#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:22,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {7113#(<= 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; {7113#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:22,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {7113#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7114#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:22,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {7114#(<= 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; {7114#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:22,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {7114#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7115#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:22,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {7115#(<= 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; {7115#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:22,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {7115#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7116#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:22,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {7116#(<= 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; {7116#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:22,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {7116#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7117#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:22,883 INFO L273 TraceCheckUtils]: 38: Hoare triple {7117#(<= 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; {7117#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:22,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {7117#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7118#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:22,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {7118#(<= 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; {7118#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:22,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {7118#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7119#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:22,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {7119#(<= 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; {7119#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:22,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {7119#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7120#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {7120#(<= main_~a~0 19)} assume !(~a~0 < 100000); {7100#false} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {7100#false} havoc ~i~0;~i~0 := 0; {7100#false} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 47: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:22,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:22,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {7100#false} assume !(~i~0 < 100000); {7100#false} is VALID [2018-11-23 11:59:22,890 INFO L273 TraceCheckUtils]: 63: Hoare triple {7100#false} havoc ~x~0;~x~0 := 0; {7100#false} is VALID [2018-11-23 11:59:22,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {7100#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7100#false} is VALID [2018-11-23 11:59:22,891 INFO L256 TraceCheckUtils]: 65: Hoare triple {7100#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {7100#false} is VALID [2018-11-23 11:59:22,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {7100#false} ~cond := #in~cond; {7100#false} is VALID [2018-11-23 11:59:22,891 INFO L273 TraceCheckUtils]: 67: Hoare triple {7100#false} assume 0 == ~cond; {7100#false} is VALID [2018-11-23 11:59:22,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {7100#false} assume !false; {7100#false} is VALID [2018-11-23 11:59:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:22,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:22,895 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-23 11:59:22,904 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:25,610 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-11-23 11:59:25,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:25,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {7099#true} call ULTIMATE.init(); {7099#true} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {7099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7099#true} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {7099#true} assume true; {7099#true} is VALID [2018-11-23 11:59:25,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7099#true} {7099#true} #63#return; {7099#true} is VALID [2018-11-23 11:59:25,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {7099#true} call #t~ret7 := main(); {7099#true} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {7099#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7139#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {7139#(<= 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; {7139#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {7139#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7102#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {7102#(<= 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; {7102#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {7102#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7103#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {7103#(<= 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; {7103#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:25,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {7103#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7104#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {7104#(<= 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; {7104#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:25,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {7104#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7105#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {7105#(<= 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; {7105#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:25,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {7105#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7106#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {7106#(<= 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; {7106#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:25,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {7106#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7107#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {7107#(<= 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; {7107#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:25,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {7107#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7108#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {7108#(<= 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; {7108#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:25,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {7108#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7109#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {7109#(<= 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; {7109#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:25,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {7109#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7110#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {7110#(<= 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; {7110#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:25,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {7110#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7111#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {7111#(<= 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; {7111#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:25,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {7111#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7112#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {7112#(<= 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; {7112#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:25,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {7112#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7113#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {7113#(<= 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; {7113#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:25,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {7113#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7114#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {7114#(<= 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; {7114#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:25,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {7114#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7115#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:25,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {7115#(<= 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; {7115#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:25,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {7115#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7116#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:25,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {7116#(<= 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; {7116#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:25,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {7116#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7117#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:25,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {7117#(<= 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; {7117#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:25,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {7117#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7118#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:25,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {7118#(<= 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; {7118#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:25,887 INFO L273 TraceCheckUtils]: 41: Hoare triple {7118#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7119#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:25,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {7119#(<= 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; {7119#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:25,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {7119#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7120#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:25,889 INFO L273 TraceCheckUtils]: 44: Hoare triple {7120#(<= main_~a~0 19)} assume !(~a~0 < 100000); {7100#false} is VALID [2018-11-23 11:59:25,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {7100#false} havoc ~i~0;~i~0 := 0; {7100#false} is VALID [2018-11-23 11:59:25,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,890 INFO L273 TraceCheckUtils]: 51: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 55: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,892 INFO L273 TraceCheckUtils]: 60: Hoare triple {7100#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7100#false} is VALID [2018-11-23 11:59:25,892 INFO L273 TraceCheckUtils]: 61: Hoare triple {7100#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7100#false} is VALID [2018-11-23 11:59:25,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {7100#false} assume !(~i~0 < 100000); {7100#false} is VALID [2018-11-23 11:59:25,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {7100#false} havoc ~x~0;~x~0 := 0; {7100#false} is VALID [2018-11-23 11:59:25,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {7100#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7100#false} is VALID [2018-11-23 11:59:25,893 INFO L256 TraceCheckUtils]: 65: Hoare triple {7100#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {7100#false} is VALID [2018-11-23 11:59:25,893 INFO L273 TraceCheckUtils]: 66: Hoare triple {7100#false} ~cond := #in~cond; {7100#false} is VALID [2018-11-23 11:59:25,893 INFO L273 TraceCheckUtils]: 67: Hoare triple {7100#false} assume 0 == ~cond; {7100#false} is VALID [2018-11-23 11:59:25,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {7100#false} assume !false; {7100#false} is VALID [2018-11-23 11:59:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:25,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:25,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:59:25,918 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 11:59:25,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:25,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:59:25,976 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-23 11:59:25,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:59:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:59:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:25,978 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 23 states. [2018-11-23 11:59:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,506 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 11:59:26,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:59:26,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-11-23 11:59:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-23 11:59:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:59:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-23 11:59:26,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 80 transitions. [2018-11-23 11:59:26,984 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-23 11:59:26,985 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:59:26,985 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:59:26,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:59:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-11-23 11:59:27,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:27,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:27,022 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:27,022 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2018-11-23 11:59:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,025 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 11:59:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 11:59:27,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,026 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2018-11-23 11:59:27,026 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2018-11-23 11:59:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,028 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 11:59:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 11:59:27,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:27,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:59:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 11:59:27,031 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2018-11-23 11:59:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:27,032 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 11:59:27,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:59:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 11:59:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:59:27,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:27,033 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:27,033 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:27,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1357113234, now seen corresponding path program 18 times [2018-11-23 11:59:27,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:27,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:27,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:27,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {7750#true} call ULTIMATE.init(); {7750#true} is VALID [2018-11-23 11:59:27,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {7750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7750#true} is VALID [2018-11-23 11:59:27,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {7750#true} assume true; {7750#true} is VALID [2018-11-23 11:59:27,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7750#true} {7750#true} #63#return; {7750#true} is VALID [2018-11-23 11:59:27,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {7750#true} call #t~ret7 := main(); {7750#true} is VALID [2018-11-23 11:59:27,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {7750#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7752#(= main_~a~0 0)} is VALID [2018-11-23 11:59:27,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {7752#(= 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; {7752#(= main_~a~0 0)} is VALID [2018-11-23 11:59:27,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {7752#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7753#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:27,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {7753#(<= 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; {7753#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:27,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {7753#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7754#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:27,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {7754#(<= 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; {7754#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:27,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {7754#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7755#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:27,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {7755#(<= 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; {7755#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:27,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {7755#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7756#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:27,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {7756#(<= 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; {7756#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:27,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {7756#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7757#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:27,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {7757#(<= 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; {7757#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:27,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {7757#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7758#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:27,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {7758#(<= 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; {7758#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:27,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {7758#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7759#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:27,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {7759#(<= 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; {7759#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:27,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {7759#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7760#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:27,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {7760#(<= 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; {7760#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:27,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {7760#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7761#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:27,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {7761#(<= 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; {7761#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:27,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {7761#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7762#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:27,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {7762#(<= 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; {7762#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:27,870 INFO L273 TraceCheckUtils]: 27: Hoare triple {7762#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7763#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:27,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {7763#(<= 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; {7763#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:27,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {7763#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7764#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:27,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {7764#(<= 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; {7764#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:27,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {7764#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7765#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:27,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {7765#(<= 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; {7765#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:27,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {7765#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7766#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:27,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {7766#(<= 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; {7766#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:27,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {7766#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7767#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:27,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {7767#(<= 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; {7767#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:27,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {7767#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7768#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:27,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {7768#(<= 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; {7768#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:27,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {7768#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7769#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:27,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {7769#(<= 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; {7769#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:27,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {7769#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7770#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:27,880 INFO L273 TraceCheckUtils]: 42: Hoare triple {7770#(<= 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; {7770#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:27,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {7770#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7771#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:27,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {7771#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {7771#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:27,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {7771#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7772#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:27,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {7772#(<= main_~a~0 20)} assume !(~a~0 < 100000); {7751#false} is VALID [2018-11-23 11:59:27,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {7751#false} havoc ~i~0;~i~0 := 0; {7751#false} is VALID [2018-11-23 11:59:27,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,883 INFO L273 TraceCheckUtils]: 50: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,884 INFO L273 TraceCheckUtils]: 52: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,884 INFO L273 TraceCheckUtils]: 55: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,885 INFO L273 TraceCheckUtils]: 57: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,885 INFO L273 TraceCheckUtils]: 58: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,885 INFO L273 TraceCheckUtils]: 59: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,885 INFO L273 TraceCheckUtils]: 60: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,885 INFO L273 TraceCheckUtils]: 61: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,886 INFO L273 TraceCheckUtils]: 62: Hoare triple {7751#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7751#false} is VALID [2018-11-23 11:59:27,886 INFO L273 TraceCheckUtils]: 63: Hoare triple {7751#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7751#false} is VALID [2018-11-23 11:59:27,886 INFO L273 TraceCheckUtils]: 64: Hoare triple {7751#false} assume !(~i~0 < 100000); {7751#false} is VALID [2018-11-23 11:59:27,886 INFO L273 TraceCheckUtils]: 65: Hoare triple {7751#false} havoc ~x~0;~x~0 := 0; {7751#false} is VALID [2018-11-23 11:59:27,886 INFO L273 TraceCheckUtils]: 66: Hoare triple {7751#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7751#false} is VALID [2018-11-23 11:59:27,887 INFO L256 TraceCheckUtils]: 67: Hoare triple {7751#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {7751#false} is VALID [2018-11-23 11:59:27,887 INFO L273 TraceCheckUtils]: 68: Hoare triple {7751#false} ~cond := #in~cond; {7751#false} is VALID [2018-11-23 11:59:27,887 INFO L273 TraceCheckUtils]: 69: Hoare triple {7751#false} assume 0 == ~cond; {7751#false} is VALID [2018-11-23 11:59:27,887 INFO L273 TraceCheckUtils]: 70: Hoare triple {7751#false} assume !false; {7751#false} is VALID [2018-11-23 11:59:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:59:27,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:27,890 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-23 11:59:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:30,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 11:59:30,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:30,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:30,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {7750#true} call ULTIMATE.init(); {7750#true} is VALID [2018-11-23 11:59:30,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {7750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7750#true} is VALID [2018-11-23 11:59:30,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {7750#true} assume true; {7750#true} is VALID [2018-11-23 11:59:30,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7750#true} {7750#true} #63#return; {7750#true} is VALID [2018-11-23 11:59:30,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {7750#true} call #t~ret7 := main(); {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {7750#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 38: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 42: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 43: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 44: Hoare triple {7750#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; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 45: Hoare triple {7750#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7750#true} is VALID [2018-11-23 11:59:30,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {7750#true} assume !(~a~0 < 100000); {7750#true} is VALID [2018-11-23 11:59:30,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {7750#true} havoc ~i~0;~i~0 := 0; {7917#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:30,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {7917#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7917#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:30,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {7917#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7924#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:30,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {7924#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7924#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:30,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {7924#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7931#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:30,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {7931#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7931#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:30,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {7931#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:30,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {7938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:30,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {7938#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7945#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:30,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {7945#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7945#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:30,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {7945#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:30,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {7952#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:30,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {7952#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7959#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:30,675 INFO L273 TraceCheckUtils]: 60: Hoare triple {7959#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7959#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:30,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {7959#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7966#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:30,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {7966#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7966#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:30,677 INFO L273 TraceCheckUtils]: 63: Hoare triple {7966#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7973#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:30,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {7973#(<= main_~i~0 8)} assume !(~i~0 < 100000); {7751#false} is VALID [2018-11-23 11:59:30,678 INFO L273 TraceCheckUtils]: 65: Hoare triple {7751#false} havoc ~x~0;~x~0 := 0; {7751#false} is VALID [2018-11-23 11:59:30,678 INFO L273 TraceCheckUtils]: 66: Hoare triple {7751#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7751#false} is VALID [2018-11-23 11:59:30,678 INFO L256 TraceCheckUtils]: 67: Hoare triple {7751#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {7751#false} is VALID [2018-11-23 11:59:30,678 INFO L273 TraceCheckUtils]: 68: Hoare triple {7751#false} ~cond := #in~cond; {7751#false} is VALID [2018-11-23 11:59:30,678 INFO L273 TraceCheckUtils]: 69: Hoare triple {7751#false} assume 0 == ~cond; {7751#false} is VALID [2018-11-23 11:59:30,679 INFO L273 TraceCheckUtils]: 70: Hoare triple {7751#false} assume !false; {7751#false} is VALID [2018-11-23 11:59:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 11:59:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:30,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 32 [2018-11-23 11:59:30,703 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 11:59:30,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:30,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:59:30,789 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-23 11:59:30,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:59:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:59:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:30,791 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 32 states. [2018-11-23 11:59:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,476 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 11:59:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:59:31,476 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-23 11:59:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 101 transitions. [2018-11-23 11:59:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 101 transitions. [2018-11-23 11:59:31,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 101 transitions. [2018-11-23 11:59:31,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:31,607 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:59:31,607 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:59:31,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:59:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-23 11:59:31,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:31,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-23 11:59:31,643 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-23 11:59:31,643 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-23 11:59:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,645 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 11:59:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:59:31,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,646 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-23 11:59:31,646 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-23 11:59:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:31,647 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 11:59:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:59:31,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:31,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:31,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:31,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:59:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-23 11:59:31,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 71 [2018-11-23 11:59:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:31,650 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-23 11:59:31,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:59:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-23 11:59:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:59:31,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:31,651 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:31,651 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:31,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1231470358, now seen corresponding path program 19 times [2018-11-23 11:59:31,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:31,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:31,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {8439#true} call ULTIMATE.init(); {8439#true} is VALID [2018-11-23 11:59:32,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {8439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8439#true} is VALID [2018-11-23 11:59:32,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {8439#true} assume true; {8439#true} is VALID [2018-11-23 11:59:32,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8439#true} {8439#true} #63#return; {8439#true} is VALID [2018-11-23 11:59:32,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {8439#true} call #t~ret7 := main(); {8439#true} is VALID [2018-11-23 11:59:32,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {8439#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8441#(= main_~a~0 0)} is VALID [2018-11-23 11:59:32,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {8441#(= 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; {8441#(= main_~a~0 0)} is VALID [2018-11-23 11:59:32,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {8441#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8442#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {8442#(<= 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; {8442#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {8442#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8443#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {8443#(<= 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; {8443#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {8443#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8444#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {8444#(<= 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; {8444#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {8444#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8445#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {8445#(<= 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; {8445#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {8445#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8446#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {8446#(<= 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; {8446#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {8446#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8447#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {8447#(<= 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; {8447#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {8447#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8448#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {8448#(<= 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; {8448#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {8448#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8449#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {8449#(<= 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; {8449#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {8449#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8450#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {8450#(<= 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; {8450#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {8450#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8451#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {8451#(<= 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; {8451#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {8451#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8452#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:32,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {8452#(<= 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; {8452#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:32,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {8452#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8453#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:32,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {8453#(<= 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; {8453#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:32,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {8453#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8454#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:32,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {8454#(<= 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; {8454#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:32,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {8454#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8455#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:32,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {8455#(<= 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; {8455#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:32,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {8455#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8456#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:32,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {8456#(<= 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; {8456#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:32,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {8456#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:32,156 INFO L273 TraceCheckUtils]: 38: Hoare triple {8457#(<= 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; {8457#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:32,156 INFO L273 TraceCheckUtils]: 39: Hoare triple {8457#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8458#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:32,157 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#(<= 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; {8458#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:32,157 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8459#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:32,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {8459#(<= 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; {8459#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:32,158 INFO L273 TraceCheckUtils]: 43: Hoare triple {8459#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:32,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {8460#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8460#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:32,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {8460#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:32,160 INFO L273 TraceCheckUtils]: 46: Hoare triple {8461#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8461#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:32,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {8461#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:32,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {8462#(<= main_~a~0 21)} assume !(~a~0 < 100000); {8440#false} is VALID [2018-11-23 11:59:32,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {8440#false} havoc ~i~0;~i~0 := 0; {8440#false} is VALID [2018-11-23 11:59:32,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,162 INFO L273 TraceCheckUtils]: 54: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,163 INFO L273 TraceCheckUtils]: 56: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,164 INFO L273 TraceCheckUtils]: 64: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,164 INFO L273 TraceCheckUtils]: 65: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L273 TraceCheckUtils]: 66: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L273 TraceCheckUtils]: 67: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {8440#false} assume !(~i~0 < 100000); {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {8440#false} havoc ~x~0;~x~0 := 0; {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L273 TraceCheckUtils]: 70: Hoare triple {8440#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8440#false} is VALID [2018-11-23 11:59:32,165 INFO L256 TraceCheckUtils]: 71: Hoare triple {8440#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {8440#false} is VALID [2018-11-23 11:59:32,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {8440#false} ~cond := #in~cond; {8440#false} is VALID [2018-11-23 11:59:32,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {8440#false} assume 0 == ~cond; {8440#false} is VALID [2018-11-23 11:59:32,166 INFO L273 TraceCheckUtils]: 74: Hoare triple {8440#false} assume !false; {8440#false} is VALID [2018-11-23 11:59:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:32,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:32,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:32,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {8439#true} call ULTIMATE.init(); {8439#true} is VALID [2018-11-23 11:59:32,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {8439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8439#true} is VALID [2018-11-23 11:59:32,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {8439#true} assume true; {8439#true} is VALID [2018-11-23 11:59:32,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8439#true} {8439#true} #63#return; {8439#true} is VALID [2018-11-23 11:59:32,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {8439#true} call #t~ret7 := main(); {8439#true} is VALID [2018-11-23 11:59:32,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {8439#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8481#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:32,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {8481#(<= 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; {8481#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:32,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {8481#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8442#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {8442#(<= 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; {8442#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:32,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {8442#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8443#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {8443#(<= 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; {8443#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:32,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {8443#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8444#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {8444#(<= 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; {8444#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:32,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {8444#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8445#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {8445#(<= 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; {8445#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:32,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {8445#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8446#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {8446#(<= 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; {8446#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:32,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {8446#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8447#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {8447#(<= 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; {8447#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:32,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {8447#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8448#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {8448#(<= 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; {8448#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:32,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {8448#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8449#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {8449#(<= 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; {8449#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:32,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {8449#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8450#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {8450#(<= 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; {8450#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:32,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {8450#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8451#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {8451#(<= 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; {8451#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:32,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {8451#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8452#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:32,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {8452#(<= 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; {8452#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:32,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {8452#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8453#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:32,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {8453#(<= 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; {8453#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:32,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {8453#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8454#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:32,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {8454#(<= 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; {8454#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:32,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {8454#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8455#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:32,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {8455#(<= 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; {8455#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:32,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {8455#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8456#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:32,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {8456#(<= 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; {8456#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:32,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {8456#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8457#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:32,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {8457#(<= 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; {8457#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:32,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {8457#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8458#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:32,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#(<= 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; {8458#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:32,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8459#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:32,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {8459#(<= 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; {8459#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:32,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {8459#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:32,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {8460#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8460#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:32,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {8460#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:32,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {8461#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8461#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:32,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {8461#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:32,440 INFO L273 TraceCheckUtils]: 48: Hoare triple {8462#(<= main_~a~0 21)} assume !(~a~0 < 100000); {8440#false} is VALID [2018-11-23 11:59:32,440 INFO L273 TraceCheckUtils]: 49: Hoare triple {8440#false} havoc ~i~0;~i~0 := 0; {8440#false} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 51: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 54: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 56: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 57: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 58: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 59: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 64: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 65: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {8440#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {8440#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8440#false} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 68: Hoare triple {8440#false} assume !(~i~0 < 100000); {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {8440#false} havoc ~x~0;~x~0 := 0; {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {8440#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L256 TraceCheckUtils]: 71: Hoare triple {8440#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {8440#false} ~cond := #in~cond; {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 73: Hoare triple {8440#false} assume 0 == ~cond; {8440#false} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {8440#false} assume !false; {8440#false} is VALID [2018-11-23 11:59:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:32,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:59:32,467 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-11-23 11:59:32,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:32,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:59:32,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:32,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:59:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:59:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:32,529 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 25 states. [2018-11-23 11:59:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,038 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-11-23 11:59:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:59:33,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-11-23 11:59:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2018-11-23 11:59:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:59:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2018-11-23 11:59:33,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 84 transitions. [2018-11-23 11:59:33,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:33,179 INFO L225 Difference]: With dead ends: 114 [2018-11-23 11:59:33,179 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:59:33,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:59:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:59:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 11:59:33,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:33,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:33,222 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:33,222 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 11:59:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,224 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 11:59:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 11:59:33,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:33,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:33,225 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:33,225 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 11:59:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:33,226 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 11:59:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 11:59:33,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:33,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:33,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:33,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:59:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-23 11:59:33,229 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2018-11-23 11:59:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:33,229 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 11:59:33,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:59:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:59:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:33,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:33,230 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:33,230 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:33,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1591940616, now seen corresponding path program 20 times [2018-11-23 11:59:33,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {9143#true} call ULTIMATE.init(); {9143#true} is VALID [2018-11-23 11:59:34,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {9143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9143#true} is VALID [2018-11-23 11:59:34,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {9143#true} assume true; {9143#true} is VALID [2018-11-23 11:59:34,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9143#true} {9143#true} #63#return; {9143#true} is VALID [2018-11-23 11:59:34,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {9143#true} call #t~ret7 := main(); {9143#true} is VALID [2018-11-23 11:59:34,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {9143#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9145#(= main_~a~0 0)} is VALID [2018-11-23 11:59:34,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {9145#(= 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; {9145#(= main_~a~0 0)} is VALID [2018-11-23 11:59:34,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {9145#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9146#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:34,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {9146#(<= 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; {9146#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:34,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {9146#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9147#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:34,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {9147#(<= 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; {9147#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:34,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {9147#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9148#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:34,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {9148#(<= 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; {9148#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:34,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {9148#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9149#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:34,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {9149#(<= 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; {9149#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:34,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {9149#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9150#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:34,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {9150#(<= 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; {9150#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:34,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {9150#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9151#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:34,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {9151#(<= 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; {9151#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:34,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {9151#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9152#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:34,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {9152#(<= 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; {9152#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:34,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {9152#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9153#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:34,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {9153#(<= 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; {9153#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:34,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {9153#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9154#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:34,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {9154#(<= 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; {9154#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:34,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {9154#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9155#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:34,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {9155#(<= 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; {9155#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:34,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {9155#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9156#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:34,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {9156#(<= 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; {9156#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:34,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {9156#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9157#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:34,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {9157#(<= 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; {9157#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:34,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {9157#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9158#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:34,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {9158#(<= 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; {9158#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:34,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {9158#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9159#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:34,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {9159#(<= 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; {9159#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:34,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {9159#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9160#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:34,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {9160#(<= 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; {9160#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:34,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {9160#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9161#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:34,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {9161#(<= 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; {9161#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:34,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {9161#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9162#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:34,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {9162#(<= 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; {9162#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:34,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {9162#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9163#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:34,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {9163#(<= 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; {9163#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:34,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {9163#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9164#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:34,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {9164#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9164#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:34,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {9164#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9165#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:34,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {9165#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9165#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:34,037 INFO L273 TraceCheckUtils]: 47: Hoare triple {9165#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9166#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:34,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {9166#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9166#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:34,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {9166#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9167#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:34,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {9167#(<= main_~a~0 22)} assume !(~a~0 < 100000); {9144#false} is VALID [2018-11-23 11:59:34,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {9144#false} havoc ~i~0;~i~0 := 0; {9144#false} is VALID [2018-11-23 11:59:34,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,040 INFO L273 TraceCheckUtils]: 58: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,041 INFO L273 TraceCheckUtils]: 60: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,041 INFO L273 TraceCheckUtils]: 61: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,041 INFO L273 TraceCheckUtils]: 62: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,041 INFO L273 TraceCheckUtils]: 63: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,041 INFO L273 TraceCheckUtils]: 64: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 65: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 66: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 67: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 68: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 69: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {9144#false} assume !(~i~0 < 100000); {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {9144#false} havoc ~x~0;~x~0 := 0; {9144#false} is VALID [2018-11-23 11:59:34,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {9144#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9144#false} is VALID [2018-11-23 11:59:34,043 INFO L256 TraceCheckUtils]: 73: Hoare triple {9144#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {9144#false} is VALID [2018-11-23 11:59:34,043 INFO L273 TraceCheckUtils]: 74: Hoare triple {9144#false} ~cond := #in~cond; {9144#false} is VALID [2018-11-23 11:59:34,043 INFO L273 TraceCheckUtils]: 75: Hoare triple {9144#false} assume 0 == ~cond; {9144#false} is VALID [2018-11-23 11:59:34,043 INFO L273 TraceCheckUtils]: 76: Hoare triple {9144#false} assume !false; {9144#false} is VALID [2018-11-23 11:59:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:34,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:34,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:34,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:34,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:34,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {9143#true} call ULTIMATE.init(); {9143#true} is VALID [2018-11-23 11:59:34,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {9143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9143#true} is VALID [2018-11-23 11:59:34,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {9143#true} assume true; {9143#true} is VALID [2018-11-23 11:59:34,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9143#true} {9143#true} #63#return; {9143#true} is VALID [2018-11-23 11:59:34,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {9143#true} call #t~ret7 := main(); {9143#true} is VALID [2018-11-23 11:59:34,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {9143#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9186#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:34,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {9186#(<= 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; {9186#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:34,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {9186#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9146#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:34,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {9146#(<= 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; {9146#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:34,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {9146#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9147#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:34,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {9147#(<= 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; {9147#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:34,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {9147#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9148#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:34,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {9148#(<= 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; {9148#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:34,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {9148#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9149#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:34,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {9149#(<= 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; {9149#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:34,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {9149#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9150#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:34,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {9150#(<= 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; {9150#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:34,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {9150#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9151#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:34,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {9151#(<= 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; {9151#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:34,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {9151#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9152#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:34,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {9152#(<= 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; {9152#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:34,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {9152#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9153#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:34,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {9153#(<= 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; {9153#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:34,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {9153#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9154#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:34,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {9154#(<= 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; {9154#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:34,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {9154#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9155#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:34,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {9155#(<= 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; {9155#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:34,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {9155#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9156#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:34,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {9156#(<= 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; {9156#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:34,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {9156#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9157#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:34,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {9157#(<= 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; {9157#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:34,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {9157#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9158#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:34,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {9158#(<= 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; {9158#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:34,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {9158#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9159#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:34,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {9159#(<= 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; {9159#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:34,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {9159#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9160#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:34,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {9160#(<= 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; {9160#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:34,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {9160#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9161#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:34,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {9161#(<= 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; {9161#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:34,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {9161#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9162#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:34,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {9162#(<= 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; {9162#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:34,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {9162#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9163#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:34,350 INFO L273 TraceCheckUtils]: 42: Hoare triple {9163#(<= 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; {9163#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:34,350 INFO L273 TraceCheckUtils]: 43: Hoare triple {9163#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9164#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:34,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {9164#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9164#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:34,352 INFO L273 TraceCheckUtils]: 45: Hoare triple {9164#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9165#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:34,352 INFO L273 TraceCheckUtils]: 46: Hoare triple {9165#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9165#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:34,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {9165#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9166#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:34,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {9166#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9166#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:34,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {9166#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9167#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:34,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {9167#(<= main_~a~0 22)} assume !(~a~0 < 100000); {9144#false} is VALID [2018-11-23 11:59:34,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {9144#false} havoc ~i~0;~i~0 := 0; {9144#false} is VALID [2018-11-23 11:59:34,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,356 INFO L273 TraceCheckUtils]: 54: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,356 INFO L273 TraceCheckUtils]: 55: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,356 INFO L273 TraceCheckUtils]: 56: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,357 INFO L273 TraceCheckUtils]: 59: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,357 INFO L273 TraceCheckUtils]: 60: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,357 INFO L273 TraceCheckUtils]: 61: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,357 INFO L273 TraceCheckUtils]: 62: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 63: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 64: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 65: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 66: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 67: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,358 INFO L273 TraceCheckUtils]: 68: Hoare triple {9144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 69: Hoare triple {9144#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 70: Hoare triple {9144#false} assume !(~i~0 < 100000); {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 71: Hoare triple {9144#false} havoc ~x~0;~x~0 := 0; {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 72: Hoare triple {9144#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L256 TraceCheckUtils]: 73: Hoare triple {9144#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 74: Hoare triple {9144#false} ~cond := #in~cond; {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 75: Hoare triple {9144#false} assume 0 == ~cond; {9144#false} is VALID [2018-11-23 11:59:34,359 INFO L273 TraceCheckUtils]: 76: Hoare triple {9144#false} assume !false; {9144#false} is VALID [2018-11-23 11:59:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:34,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:59:34,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 77 [2018-11-23 11:59:34,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:34,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:59:34,446 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-23 11:59:34,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:59:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:59:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:34,447 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 26 states. [2018-11-23 11:59:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,872 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-11-23 11:59:34,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:59:34,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 77 [2018-11-23 11:59:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 86 transitions. [2018-11-23 11:59:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 86 transitions. [2018-11-23 11:59:34,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 86 transitions. [2018-11-23 11:59:34,955 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-23 11:59:34,957 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:59:34,957 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:59:34,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:59:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:59:34,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:34,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:34,995 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:34,995 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,997 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-11-23 11:59:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-11-23 11:59:34,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,997 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:34,997 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,998 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-11-23 11:59:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-11-23 11:59:34,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:34,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:59:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-11-23 11:59:35,000 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 77 [2018-11-23 11:59:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:35,001 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-23 11:59:35,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:59:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-23 11:59:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:35,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:35,002 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:35,002 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:35,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 470555558, now seen corresponding path program 21 times [2018-11-23 11:59:35,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:35,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:35,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {9864#true} call ULTIMATE.init(); {9864#true} is VALID [2018-11-23 11:59:35,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {9864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9864#true} is VALID [2018-11-23 11:59:35,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {9864#true} assume true; {9864#true} is VALID [2018-11-23 11:59:35,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9864#true} {9864#true} #63#return; {9864#true} is VALID [2018-11-23 11:59:35,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {9864#true} call #t~ret7 := main(); {9864#true} is VALID [2018-11-23 11:59:35,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {9864#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9866#(= main_~a~0 0)} is VALID [2018-11-23 11:59:35,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {9866#(= 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; {9866#(= main_~a~0 0)} is VALID [2018-11-23 11:59:35,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {9866#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9867#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:35,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {9867#(<= 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; {9867#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:35,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {9867#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9868#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:35,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {9868#(<= 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; {9868#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:35,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {9868#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9869#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:35,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {9869#(<= 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; {9869#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:35,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {9869#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9870#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:35,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {9870#(<= 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; {9870#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:35,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {9870#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9871#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:35,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {9871#(<= 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; {9871#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:35,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {9871#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9872#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:35,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {9872#(<= 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; {9872#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:35,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {9872#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9873#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:35,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {9873#(<= 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; {9873#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:35,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {9873#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9874#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:35,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {9874#(<= 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; {9874#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:35,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {9874#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9875#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:35,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {9875#(<= 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; {9875#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:35,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {9875#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9876#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:35,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {9876#(<= 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; {9876#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:35,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {9876#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9877#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:35,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {9877#(<= 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; {9877#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:35,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {9877#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9878#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:35,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {9878#(<= 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; {9878#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:35,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {9878#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9879#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:35,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {9879#(<= 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; {9879#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:35,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {9879#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9880#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:35,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {9880#(<= 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; {9880#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:35,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {9880#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9881#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:35,899 INFO L273 TraceCheckUtils]: 36: Hoare triple {9881#(<= 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; {9881#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:35,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {9881#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9882#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:35,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {9882#(<= 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; {9882#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:35,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {9882#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9883#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:35,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {9883#(<= 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; {9883#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:35,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {9883#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9884#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:35,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {9884#(<= 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; {9884#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:35,903 INFO L273 TraceCheckUtils]: 43: Hoare triple {9884#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9885#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:35,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {9885#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9885#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:35,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {9885#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9886#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:35,905 INFO L273 TraceCheckUtils]: 46: Hoare triple {9886#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9886#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:35,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {9886#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9887#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:35,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {9887#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9887#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:35,907 INFO L273 TraceCheckUtils]: 49: Hoare triple {9887#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9888#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:35,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {9888#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9888#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:35,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {9888#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9889#(<= main_~a~0 23)} is VALID [2018-11-23 11:59:35,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {9889#(<= main_~a~0 23)} assume !(~a~0 < 100000); {9865#false} is VALID [2018-11-23 11:59:35,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {9865#false} havoc ~i~0;~i~0 := 0; {9865#false} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 54: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 59: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 60: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 62: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 64: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 66: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 67: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 70: Hoare triple {9865#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 71: Hoare triple {9865#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 72: Hoare triple {9865#false} assume !(~i~0 < 100000); {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 73: Hoare triple {9865#false} havoc ~x~0;~x~0 := 0; {9865#false} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 74: Hoare triple {9865#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9865#false} is VALID [2018-11-23 11:59:35,914 INFO L256 TraceCheckUtils]: 75: Hoare triple {9865#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {9865#false} is VALID [2018-11-23 11:59:35,914 INFO L273 TraceCheckUtils]: 76: Hoare triple {9865#false} ~cond := #in~cond; {9865#false} is VALID [2018-11-23 11:59:35,914 INFO L273 TraceCheckUtils]: 77: Hoare triple {9865#false} assume 0 == ~cond; {9865#false} is VALID [2018-11-23 11:59:35,914 INFO L273 TraceCheckUtils]: 78: Hoare triple {9865#false} assume !false; {9865#false} is VALID [2018-11-23 11:59:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:59:35,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:35,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:36,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:59:36,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:36,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {9864#true} call ULTIMATE.init(); {9864#true} is VALID [2018-11-23 11:59:36,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {9864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9864#true} is VALID [2018-11-23 11:59:36,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {9864#true} assume true; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9864#true} {9864#true} #63#return; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {9864#true} call #t~ret7 := main(); {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {9864#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 20: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,896 INFO L273 TraceCheckUtils]: 35: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 36: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 41: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 47: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 49: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 50: Hoare triple {9864#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; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {9864#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9864#true} is VALID [2018-11-23 11:59:36,898 INFO L273 TraceCheckUtils]: 52: Hoare triple {9864#true} assume !(~a~0 < 100000); {9864#true} is VALID [2018-11-23 11:59:36,899 INFO L273 TraceCheckUtils]: 53: Hoare triple {9864#true} havoc ~i~0;~i~0 := 0; {10052#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:36,899 INFO L273 TraceCheckUtils]: 54: Hoare triple {10052#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10052#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:36,900 INFO L273 TraceCheckUtils]: 55: Hoare triple {10052#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10059#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:36,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {10059#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10059#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:36,900 INFO L273 TraceCheckUtils]: 57: Hoare triple {10059#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10066#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:36,901 INFO L273 TraceCheckUtils]: 58: Hoare triple {10066#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10066#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:36,901 INFO L273 TraceCheckUtils]: 59: Hoare triple {10066#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10073#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:36,901 INFO L273 TraceCheckUtils]: 60: Hoare triple {10073#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10073#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:36,902 INFO L273 TraceCheckUtils]: 61: Hoare triple {10073#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10080#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:36,902 INFO L273 TraceCheckUtils]: 62: Hoare triple {10080#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10080#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:36,903 INFO L273 TraceCheckUtils]: 63: Hoare triple {10080#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10087#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:36,904 INFO L273 TraceCheckUtils]: 64: Hoare triple {10087#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10087#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:36,904 INFO L273 TraceCheckUtils]: 65: Hoare triple {10087#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10094#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:36,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {10094#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10094#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:36,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {10094#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10101#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:36,906 INFO L273 TraceCheckUtils]: 68: Hoare triple {10101#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10101#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:36,907 INFO L273 TraceCheckUtils]: 69: Hoare triple {10101#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:36,907 INFO L273 TraceCheckUtils]: 70: Hoare triple {10108#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10108#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:36,908 INFO L273 TraceCheckUtils]: 71: Hoare triple {10108#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10115#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:36,909 INFO L273 TraceCheckUtils]: 72: Hoare triple {10115#(<= main_~i~0 9)} assume !(~i~0 < 100000); {9865#false} is VALID [2018-11-23 11:59:36,909 INFO L273 TraceCheckUtils]: 73: Hoare triple {9865#false} havoc ~x~0;~x~0 := 0; {9865#false} is VALID [2018-11-23 11:59:36,909 INFO L273 TraceCheckUtils]: 74: Hoare triple {9865#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9865#false} is VALID [2018-11-23 11:59:36,909 INFO L256 TraceCheckUtils]: 75: Hoare triple {9865#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {9865#false} is VALID [2018-11-23 11:59:36,910 INFO L273 TraceCheckUtils]: 76: Hoare triple {9865#false} ~cond := #in~cond; {9865#false} is VALID [2018-11-23 11:59:36,910 INFO L273 TraceCheckUtils]: 77: Hoare triple {9865#false} assume 0 == ~cond; {9865#false} is VALID [2018-11-23 11:59:36,910 INFO L273 TraceCheckUtils]: 78: Hoare triple {9865#false} assume !false; {9865#false} is VALID [2018-11-23 11:59:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 11:59:36,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:36,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 36 [2018-11-23 11:59:36,935 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-23 11:59:36,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:36,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:59:37,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:37,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:59:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:59:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:37,025 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 36 states. [2018-11-23 11:59:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,691 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 11:59:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:59:37,691 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-23 11:59:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 109 transitions. [2018-11-23 11:59:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 109 transitions. [2018-11-23 11:59:37,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 109 transitions. [2018-11-23 11:59:37,800 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-23 11:59:37,801 INFO L225 Difference]: With dead ends: 121 [2018-11-23 11:59:37,802 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:59:37,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:59:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 11:59:37,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:37,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 11:59:37,842 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 11:59:37,842 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 11:59:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,844 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:59:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:59:37,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:37,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:37,845 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 11:59:37,845 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 11:59:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,847 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:59:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:59:37,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:37,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:37,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:37,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:59:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-23 11:59:37,849 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 79 [2018-11-23 11:59:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:37,850 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-23 11:59:37,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:59:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-11-23 11:59:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:59:37,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:37,851 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:37,851 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:37,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1693591518, now seen corresponding path program 22 times [2018-11-23 11:59:37,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:38,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {10624#true} call ULTIMATE.init(); {10624#true} is VALID [2018-11-23 11:59:38,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {10624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10624#true} is VALID [2018-11-23 11:59:38,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {10624#true} assume true; {10624#true} is VALID [2018-11-23 11:59:38,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10624#true} {10624#true} #63#return; {10624#true} is VALID [2018-11-23 11:59:38,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {10624#true} call #t~ret7 := main(); {10624#true} is VALID [2018-11-23 11:59:38,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {10624#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10626#(= main_~a~0 0)} is VALID [2018-11-23 11:59:38,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {10626#(= 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; {10626#(= main_~a~0 0)} is VALID [2018-11-23 11:59:38,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {10626#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10627#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:38,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {10627#(<= 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; {10627#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:38,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {10627#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10628#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:38,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {10628#(<= 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; {10628#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:38,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {10628#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10629#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:38,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {10629#(<= 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; {10629#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:38,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {10629#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10630#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:38,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {10630#(<= 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; {10630#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:38,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {10630#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10631#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:38,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {10631#(<= 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; {10631#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:38,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {10631#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10632#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:38,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {10632#(<= 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; {10632#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:38,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {10632#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10633#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:38,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {10633#(<= 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; {10633#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:38,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {10633#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10634#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:38,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {10634#(<= 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; {10634#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:38,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {10634#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10635#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:38,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {10635#(<= 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; {10635#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:38,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {10635#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10636#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:38,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {10636#(<= 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; {10636#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:38,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {10636#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10637#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:38,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {10637#(<= 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; {10637#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:38,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {10637#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10638#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:38,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {10638#(<= 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; {10638#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:38,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {10638#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10639#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:38,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {10639#(<= 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; {10639#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:38,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {10639#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10640#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:38,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {10640#(<= 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; {10640#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:38,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {10640#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10641#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:38,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {10641#(<= 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; {10641#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:38,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {10641#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10642#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:38,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {10642#(<= 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; {10642#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:38,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {10642#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10643#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:38,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {10643#(<= 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; {10643#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:38,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {10643#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10644#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:38,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {10644#(<= 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; {10644#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:38,649 INFO L273 TraceCheckUtils]: 43: Hoare triple {10644#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:38,649 INFO L273 TraceCheckUtils]: 44: Hoare triple {10645#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10645#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:38,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {10645#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:38,651 INFO L273 TraceCheckUtils]: 46: Hoare triple {10646#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10646#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:38,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {10646#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:38,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {10647#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10647#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:38,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {10647#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:38,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {10648#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10648#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:38,658 INFO L273 TraceCheckUtils]: 51: Hoare triple {10648#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~a~0 23)} is VALID [2018-11-23 11:59:38,658 INFO L273 TraceCheckUtils]: 52: Hoare triple {10649#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10649#(<= main_~a~0 23)} is VALID [2018-11-23 11:59:38,660 INFO L273 TraceCheckUtils]: 53: Hoare triple {10649#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~a~0 24)} is VALID [2018-11-23 11:59:38,660 INFO L273 TraceCheckUtils]: 54: Hoare triple {10650#(<= main_~a~0 24)} assume !(~a~0 < 100000); {10625#false} is VALID [2018-11-23 11:59:38,660 INFO L273 TraceCheckUtils]: 55: Hoare triple {10625#false} havoc ~i~0;~i~0 := 0; {10625#false} is VALID [2018-11-23 11:59:38,660 INFO L273 TraceCheckUtils]: 56: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 57: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 58: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 59: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 60: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 63: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 64: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,661 INFO L273 TraceCheckUtils]: 65: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 66: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 67: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 68: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 69: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 70: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 71: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 72: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 73: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,662 INFO L273 TraceCheckUtils]: 74: Hoare triple {10625#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 75: Hoare triple {10625#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 76: Hoare triple {10625#false} assume !(~i~0 < 100000); {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 77: Hoare triple {10625#false} havoc ~x~0;~x~0 := 0; {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 78: Hoare triple {10625#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L256 TraceCheckUtils]: 79: Hoare triple {10625#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 80: Hoare triple {10625#false} ~cond := #in~cond; {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 81: Hoare triple {10625#false} assume 0 == ~cond; {10625#false} is VALID [2018-11-23 11:59:38,663 INFO L273 TraceCheckUtils]: 82: Hoare triple {10625#false} assume !false; {10625#false} is VALID [2018-11-23 11:59:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:59:38,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:38,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:38,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:38,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:38,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:39,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {10624#true} call ULTIMATE.init(); {10624#true} is VALID [2018-11-23 11:59:39,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {10624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10624#true} is VALID [2018-11-23 11:59:39,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {10624#true} assume true; {10624#true} is VALID [2018-11-23 11:59:39,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10624#true} {10624#true} #63#return; {10624#true} is VALID [2018-11-23 11:59:39,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {10624#true} call #t~ret7 := main(); {10624#true} is VALID [2018-11-23 11:59:39,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {10624#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10624#true} is VALID [2018-11-23 11:59:39,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,306 INFO L273 TraceCheckUtils]: 37: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 43: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,307 INFO L273 TraceCheckUtils]: 44: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 45: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 46: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 47: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 48: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {10624#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; {10624#true} is VALID [2018-11-23 11:59:39,309 INFO L273 TraceCheckUtils]: 53: Hoare triple {10624#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#true} is VALID [2018-11-23 11:59:39,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {10624#true} assume !(~a~0 < 100000); {10624#true} is VALID [2018-11-23 11:59:39,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {10624#true} havoc ~i~0;~i~0 := 0; {10819#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:39,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {10819#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10819#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:39,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {10819#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10826#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:39,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {10826#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10826#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:39,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {10826#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10833#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:39,312 INFO L273 TraceCheckUtils]: 60: Hoare triple {10833#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10833#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:39,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {10833#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10840#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:39,313 INFO L273 TraceCheckUtils]: 62: Hoare triple {10840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10840#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:39,313 INFO L273 TraceCheckUtils]: 63: Hoare triple {10840#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10847#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:39,314 INFO L273 TraceCheckUtils]: 64: Hoare triple {10847#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10847#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:39,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {10847#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10854#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:39,316 INFO L273 TraceCheckUtils]: 66: Hoare triple {10854#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10854#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:39,316 INFO L273 TraceCheckUtils]: 67: Hoare triple {10854#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10861#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:39,317 INFO L273 TraceCheckUtils]: 68: Hoare triple {10861#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10861#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:39,318 INFO L273 TraceCheckUtils]: 69: Hoare triple {10861#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10868#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:39,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {10868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10868#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:39,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {10868#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10875#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:39,320 INFO L273 TraceCheckUtils]: 72: Hoare triple {10875#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10875#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:39,321 INFO L273 TraceCheckUtils]: 73: Hoare triple {10875#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10882#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:39,321 INFO L273 TraceCheckUtils]: 74: Hoare triple {10882#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10882#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:39,322 INFO L273 TraceCheckUtils]: 75: Hoare triple {10882#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10889#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:39,323 INFO L273 TraceCheckUtils]: 76: Hoare triple {10889#(<= main_~i~0 10)} assume !(~i~0 < 100000); {10625#false} is VALID [2018-11-23 11:59:39,323 INFO L273 TraceCheckUtils]: 77: Hoare triple {10625#false} havoc ~x~0;~x~0 := 0; {10625#false} is VALID [2018-11-23 11:59:39,324 INFO L273 TraceCheckUtils]: 78: Hoare triple {10625#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10625#false} is VALID [2018-11-23 11:59:39,324 INFO L256 TraceCheckUtils]: 79: Hoare triple {10625#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {10625#false} is VALID [2018-11-23 11:59:39,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {10625#false} ~cond := #in~cond; {10625#false} is VALID [2018-11-23 11:59:39,324 INFO L273 TraceCheckUtils]: 81: Hoare triple {10625#false} assume 0 == ~cond; {10625#false} is VALID [2018-11-23 11:59:39,325 INFO L273 TraceCheckUtils]: 82: Hoare triple {10625#false} assume !false; {10625#false} is VALID [2018-11-23 11:59:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-23 11:59:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13] total 38 [2018-11-23 11:59:39,353 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-11-23 11:59:39,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:39,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:59:39,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:39,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:59:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:59:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:39,459 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 38 states. [2018-11-23 11:59:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,444 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-23 11:59:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:59:40,445 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-11-23 11:59:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 113 transitions. [2018-11-23 11:59:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 113 transitions. [2018-11-23 11:59:40,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 113 transitions. [2018-11-23 11:59:40,573 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-23 11:59:40,575 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:59:40,575 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 11:59:40,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 11:59:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-23 11:59:40,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:40,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-23 11:59:40,621 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-23 11:59:40,622 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-23 11:59:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,624 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-23 11:59:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-23 11:59:40,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:40,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:40,624 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-23 11:59:40,624 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-23 11:59:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,625 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-23 11:59:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-23 11:59:40,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:40,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:40,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:40,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 11:59:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-23 11:59:40,627 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 83 [2018-11-23 11:59:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:40,627 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-23 11:59:40,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:59:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-23 11:59:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:59:40,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:40,628 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:40,628 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:40,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1834083998, now seen corresponding path program 23 times [2018-11-23 11:59:40,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:40,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:40,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:40,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:41,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {11421#true} call ULTIMATE.init(); {11421#true} is VALID [2018-11-23 11:59:41,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {11421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11421#true} is VALID [2018-11-23 11:59:41,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {11421#true} assume true; {11421#true} is VALID [2018-11-23 11:59:41,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11421#true} {11421#true} #63#return; {11421#true} is VALID [2018-11-23 11:59:41,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {11421#true} call #t~ret7 := main(); {11421#true} is VALID [2018-11-23 11:59:41,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {11421#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11423#(= main_~a~0 0)} is VALID [2018-11-23 11:59:41,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {11423#(= 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; {11423#(= main_~a~0 0)} is VALID [2018-11-23 11:59:41,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {11423#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11424#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {11424#(<= 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; {11424#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {11424#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11425#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {11425#(<= 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; {11425#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {11425#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11426#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {11426#(<= 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; {11426#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {11426#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11427#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {11427#(<= 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; {11427#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {11427#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11428#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {11428#(<= 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; {11428#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {11428#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11429#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {11429#(<= 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; {11429#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {11429#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11430#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {11430#(<= 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; {11430#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {11430#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11431#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:41,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {11431#(<= 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; {11431#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:41,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {11431#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11432#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:41,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {11432#(<= 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; {11432#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:41,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {11432#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11433#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:41,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {11433#(<= 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; {11433#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:41,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {11433#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11434#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:41,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {11434#(<= 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; {11434#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:41,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {11434#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11435#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:41,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {11435#(<= 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; {11435#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:41,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {11435#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11436#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:41,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {11436#(<= 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; {11436#(<= main_~a~0 13)} is VALID [2018-11-23 11:59:41,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {11436#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11437#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:41,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {11437#(<= 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; {11437#(<= main_~a~0 14)} is VALID [2018-11-23 11:59:41,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {11437#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11438#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:41,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {11438#(<= 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; {11438#(<= main_~a~0 15)} is VALID [2018-11-23 11:59:41,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {11438#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11439#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:41,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {11439#(<= 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; {11439#(<= main_~a~0 16)} is VALID [2018-11-23 11:59:41,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {11439#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:41,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#(<= 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; {11440#(<= main_~a~0 17)} is VALID [2018-11-23 11:59:41,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11441#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:41,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {11441#(<= 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; {11441#(<= main_~a~0 18)} is VALID [2018-11-23 11:59:41,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {11441#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11442#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:41,124 INFO L273 TraceCheckUtils]: 44: Hoare triple {11442#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11442#(<= main_~a~0 19)} is VALID [2018-11-23 11:59:41,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {11442#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11443#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:41,125 INFO L273 TraceCheckUtils]: 46: Hoare triple {11443#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11443#(<= main_~a~0 20)} is VALID [2018-11-23 11:59:41,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {11443#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11444#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:41,126 INFO L273 TraceCheckUtils]: 48: Hoare triple {11444#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11444#(<= main_~a~0 21)} is VALID [2018-11-23 11:59:41,127 INFO L273 TraceCheckUtils]: 49: Hoare triple {11444#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11445#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:41,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {11445#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11445#(<= main_~a~0 22)} is VALID [2018-11-23 11:59:41,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {11445#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11446#(<= main_~a~0 23)} is VALID [2018-11-23 11:59:41,129 INFO L273 TraceCheckUtils]: 52: Hoare triple {11446#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11446#(<= main_~a~0 23)} is VALID [2018-11-23 11:59:41,129 INFO L273 TraceCheckUtils]: 53: Hoare triple {11446#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11447#(<= main_~a~0 24)} is VALID [2018-11-23 11:59:41,130 INFO L273 TraceCheckUtils]: 54: Hoare triple {11447#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11447#(<= main_~a~0 24)} is VALID [2018-11-23 11:59:41,131 INFO L273 TraceCheckUtils]: 55: Hoare triple {11447#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11448#(<= main_~a~0 25)} is VALID [2018-11-23 11:59:41,131 INFO L273 TraceCheckUtils]: 56: Hoare triple {11448#(<= main_~a~0 25)} assume !(~a~0 < 100000); {11422#false} is VALID [2018-11-23 11:59:41,132 INFO L273 TraceCheckUtils]: 57: Hoare triple {11422#false} havoc ~i~0;~i~0 := 0; {11422#false} is VALID [2018-11-23 11:59:41,132 INFO L273 TraceCheckUtils]: 58: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,132 INFO L273 TraceCheckUtils]: 60: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,132 INFO L273 TraceCheckUtils]: 61: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,133 INFO L273 TraceCheckUtils]: 65: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 66: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 67: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 68: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 69: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,134 INFO L273 TraceCheckUtils]: 71: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,135 INFO L273 TraceCheckUtils]: 72: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,135 INFO L273 TraceCheckUtils]: 73: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,135 INFO L273 TraceCheckUtils]: 76: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 77: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 79: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 80: Hoare triple {11422#false} assume !(~i~0 < 100000); {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {11422#false} havoc ~x~0;~x~0 := 0; {11422#false} is VALID [2018-11-23 11:59:41,136 INFO L273 TraceCheckUtils]: 82: Hoare triple {11422#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11422#false} is VALID [2018-11-23 11:59:41,137 INFO L256 TraceCheckUtils]: 83: Hoare triple {11422#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {11422#false} is VALID [2018-11-23 11:59:41,137 INFO L273 TraceCheckUtils]: 84: Hoare triple {11422#false} ~cond := #in~cond; {11422#false} is VALID [2018-11-23 11:59:41,137 INFO L273 TraceCheckUtils]: 85: Hoare triple {11422#false} assume 0 == ~cond; {11422#false} is VALID [2018-11-23 11:59:41,137 INFO L273 TraceCheckUtils]: 86: Hoare triple {11422#false} assume !false; {11422#false} is VALID [2018-11-23 11:59:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:59:41,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:41,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:15,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-11-23 12:00:15,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:15,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:16,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {11421#true} call ULTIMATE.init(); {11421#true} is VALID [2018-11-23 12:00:16,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {11421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11421#true} is VALID [2018-11-23 12:00:16,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {11421#true} assume true; {11421#true} is VALID [2018-11-23 12:00:16,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11421#true} {11421#true} #63#return; {11421#true} is VALID [2018-11-23 12:00:16,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {11421#true} call #t~ret7 := main(); {11421#true} is VALID [2018-11-23 12:00:16,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {11421#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11467#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:16,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {11467#(<= 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; {11467#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:16,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {11467#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11424#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:16,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {11424#(<= 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; {11424#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:16,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {11424#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11425#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:16,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {11425#(<= 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; {11425#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:16,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {11425#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11426#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:16,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {11426#(<= 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; {11426#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:16,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {11426#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11427#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:16,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {11427#(<= 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; {11427#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:16,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {11427#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11428#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:16,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {11428#(<= 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; {11428#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:16,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {11428#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11429#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:16,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {11429#(<= 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; {11429#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:16,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {11429#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11430#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:16,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {11430#(<= 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; {11430#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:16,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {11430#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11431#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:16,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {11431#(<= 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; {11431#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:16,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {11431#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11432#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:16,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {11432#(<= 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; {11432#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:16,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {11432#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11433#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:16,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {11433#(<= 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; {11433#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:16,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {11433#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11434#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:16,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {11434#(<= 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; {11434#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:16,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {11434#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11435#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:16,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {11435#(<= 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; {11435#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:16,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {11435#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11436#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:16,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {11436#(<= 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; {11436#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:16,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {11436#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11437#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:16,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {11437#(<= 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; {11437#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:16,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {11437#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11438#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:16,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {11438#(<= 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; {11438#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:16,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {11438#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11439#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:16,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {11439#(<= 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; {11439#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:16,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {11439#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:16,168 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#(<= 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; {11440#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:16,168 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11441#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:16,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {11441#(<= 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; {11441#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:16,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {11441#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11442#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:16,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {11442#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11442#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:16,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {11442#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11443#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:16,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {11443#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11443#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:16,172 INFO L273 TraceCheckUtils]: 47: Hoare triple {11443#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11444#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:16,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {11444#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11444#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:16,173 INFO L273 TraceCheckUtils]: 49: Hoare triple {11444#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11445#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:16,173 INFO L273 TraceCheckUtils]: 50: Hoare triple {11445#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11445#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:16,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {11445#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11446#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:16,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {11446#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11446#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:16,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {11446#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11447#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:16,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {11447#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11447#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:16,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {11447#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11448#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:16,177 INFO L273 TraceCheckUtils]: 56: Hoare triple {11448#(<= main_~a~0 25)} assume !(~a~0 < 100000); {11422#false} is VALID [2018-11-23 12:00:16,177 INFO L273 TraceCheckUtils]: 57: Hoare triple {11422#false} havoc ~i~0;~i~0 := 0; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,178 INFO L273 TraceCheckUtils]: 63: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,179 INFO L273 TraceCheckUtils]: 67: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,179 INFO L273 TraceCheckUtils]: 68: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 69: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 70: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,180 INFO L273 TraceCheckUtils]: 74: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,181 INFO L273 TraceCheckUtils]: 75: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,181 INFO L273 TraceCheckUtils]: 76: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,181 INFO L273 TraceCheckUtils]: 77: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,181 INFO L273 TraceCheckUtils]: 78: Hoare triple {11422#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11422#false} is VALID [2018-11-23 12:00:16,181 INFO L273 TraceCheckUtils]: 79: Hoare triple {11422#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L273 TraceCheckUtils]: 80: Hoare triple {11422#false} assume !(~i~0 < 100000); {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L273 TraceCheckUtils]: 81: Hoare triple {11422#false} havoc ~x~0;~x~0 := 0; {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L273 TraceCheckUtils]: 82: Hoare triple {11422#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L256 TraceCheckUtils]: 83: Hoare triple {11422#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L273 TraceCheckUtils]: 84: Hoare triple {11422#false} ~cond := #in~cond; {11422#false} is VALID [2018-11-23 12:00:16,182 INFO L273 TraceCheckUtils]: 85: Hoare triple {11422#false} assume 0 == ~cond; {11422#false} is VALID [2018-11-23 12:00:16,183 INFO L273 TraceCheckUtils]: 86: Hoare triple {11422#false} assume !false; {11422#false} is VALID [2018-11-23 12:00:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 12:00:16,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:16,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:00:16,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-11-23 12:00:16,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:16,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:00:16,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:16,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:00:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:00:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:00:16,282 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 29 states. [2018-11-23 12:00:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,809 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 12:00:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:00:16,809 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-11-23 12:00:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:00:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 92 transitions. [2018-11-23 12:00:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:00:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 92 transitions. [2018-11-23 12:00:16,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 92 transitions. [2018-11-23 12:00:16,894 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-23 12:00:16,896 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:00:16,896 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:00:16,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:00:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:00:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 12:00:16,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:16,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-23 12:00:16,946 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-23 12:00:16,946 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-23 12:00:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,948 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-23 12:00:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-23 12:00:16,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,949 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-23 12:00:16,949 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-23 12:00:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,950 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-23 12:00:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-23 12:00:16,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:16,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:16,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:16,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:00:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-23 12:00:16,953 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 87 [2018-11-23 12:00:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:16,953 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-23 12:00:16,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:00:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-23 12:00:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:00:16,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:16,954 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:16,955 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:16,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash -404816196, now seen corresponding path program 24 times [2018-11-23 12:00:16,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:16,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:17,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {12231#true} call ULTIMATE.init(); {12231#true} is VALID [2018-11-23 12:00:17,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {12231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12231#true} is VALID [2018-11-23 12:00:17,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {12231#true} assume true; {12231#true} is VALID [2018-11-23 12:00:17,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12231#true} {12231#true} #63#return; {12231#true} is VALID [2018-11-23 12:00:17,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {12231#true} call #t~ret7 := main(); {12231#true} is VALID [2018-11-23 12:00:17,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {12231#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12233#(= main_~a~0 0)} is VALID [2018-11-23 12:00:17,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {12233#(= 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; {12233#(= main_~a~0 0)} is VALID [2018-11-23 12:00:17,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {12233#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:17,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {12234#(<= 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; {12234#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:17,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {12234#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12235#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:17,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {12235#(<= 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; {12235#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:17,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {12235#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:17,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {12236#(<= 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; {12236#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:17,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {12236#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12237#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:17,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {12237#(<= 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; {12237#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:17,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {12237#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12238#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:17,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {12238#(<= 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; {12238#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:17,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {12238#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12239#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:17,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {12239#(<= 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; {12239#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:17,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {12239#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12240#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:17,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {12240#(<= 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; {12240#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:17,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {12240#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12241#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:17,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {12241#(<= 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; {12241#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:17,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {12241#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12242#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:17,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {12242#(<= 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; {12242#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:17,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {12242#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:17,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {12243#(<= 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; {12243#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:17,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {12243#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12244#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:17,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {12244#(<= 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; {12244#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:17,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {12244#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12245#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:17,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {12245#(<= 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; {12245#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:17,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {12245#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12246#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:17,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {12246#(<= 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; {12246#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:17,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {12246#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12247#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:17,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {12247#(<= 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; {12247#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:17,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {12247#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12248#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:17,739 INFO L273 TraceCheckUtils]: 36: Hoare triple {12248#(<= 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; {12248#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:17,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {12248#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12249#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:17,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {12249#(<= 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; {12249#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:17,741 INFO L273 TraceCheckUtils]: 39: Hoare triple {12249#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12250#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:17,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {12250#(<= 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; {12250#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:17,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {12250#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12251#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:17,743 INFO L273 TraceCheckUtils]: 42: Hoare triple {12251#(<= 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; {12251#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:17,743 INFO L273 TraceCheckUtils]: 43: Hoare triple {12251#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12252#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:17,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {12252#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12252#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:17,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {12252#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12253#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:17,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {12253#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12253#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:17,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {12253#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12254#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:17,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {12254#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12254#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:17,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {12254#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12255#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:17,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {12255#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12255#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:17,749 INFO L273 TraceCheckUtils]: 51: Hoare triple {12255#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12256#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:17,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {12256#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12256#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:17,750 INFO L273 TraceCheckUtils]: 53: Hoare triple {12256#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12257#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:17,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {12257#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12257#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:17,751 INFO L273 TraceCheckUtils]: 55: Hoare triple {12257#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12258#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:17,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {12258#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {12258#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:17,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {12258#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12259#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:17,753 INFO L273 TraceCheckUtils]: 58: Hoare triple {12259#(<= main_~a~0 26)} assume !(~a~0 < 100000); {12232#false} is VALID [2018-11-23 12:00:17,753 INFO L273 TraceCheckUtils]: 59: Hoare triple {12232#false} havoc ~i~0;~i~0 := 0; {12232#false} is VALID [2018-11-23 12:00:17,753 INFO L273 TraceCheckUtils]: 60: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,754 INFO L273 TraceCheckUtils]: 62: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,754 INFO L273 TraceCheckUtils]: 63: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,754 INFO L273 TraceCheckUtils]: 64: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,754 INFO L273 TraceCheckUtils]: 65: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,755 INFO L273 TraceCheckUtils]: 68: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,755 INFO L273 TraceCheckUtils]: 69: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,755 INFO L273 TraceCheckUtils]: 70: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,756 INFO L273 TraceCheckUtils]: 72: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,756 INFO L273 TraceCheckUtils]: 73: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,757 INFO L273 TraceCheckUtils]: 76: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,757 INFO L273 TraceCheckUtils]: 80: Hoare triple {12232#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {12232#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L273 TraceCheckUtils]: 82: Hoare triple {12232#false} assume !(~i~0 < 100000); {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L273 TraceCheckUtils]: 83: Hoare triple {12232#false} havoc ~x~0;~x~0 := 0; {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L273 TraceCheckUtils]: 84: Hoare triple {12232#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L256 TraceCheckUtils]: 85: Hoare triple {12232#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {12232#false} is VALID [2018-11-23 12:00:17,758 INFO L273 TraceCheckUtils]: 86: Hoare triple {12232#false} ~cond := #in~cond; {12232#false} is VALID [2018-11-23 12:00:17,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {12232#false} assume 0 == ~cond; {12232#false} is VALID [2018-11-23 12:00:17,759 INFO L273 TraceCheckUtils]: 88: Hoare triple {12232#false} assume !false; {12232#false} is VALID [2018-11-23 12:00:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 12:00:17,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:17,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:37,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:00:37,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:37,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {12231#true} call ULTIMATE.init(); {12231#true} is VALID [2018-11-23 12:00:37,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {12231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12231#true} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {12231#true} assume true; {12231#true} is VALID [2018-11-23 12:00:37,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12231#true} {12231#true} #63#return; {12231#true} is VALID [2018-11-23 12:00:37,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {12231#true} call #t~ret7 := main(); {12231#true} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {12231#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12231#true} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 37: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 53: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 54: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 55: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 56: Hoare triple {12231#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; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {12231#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#true} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {12231#true} assume !(~a~0 < 100000); {12231#true} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {12231#true} havoc ~i~0;~i~0 := 0; {12440#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {12440#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12440#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:37,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {12440#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12447#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:37,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {12447#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12447#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {12447#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12454#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {12454#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12454#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 65: Hoare triple {12454#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12461#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {12461#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12461#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {12461#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12468#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 68: Hoare triple {12468#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12468#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,664 INFO L273 TraceCheckUtils]: 69: Hoare triple {12468#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12475#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,664 INFO L273 TraceCheckUtils]: 70: Hoare triple {12475#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12475#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,665 INFO L273 TraceCheckUtils]: 71: Hoare triple {12475#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12482#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,666 INFO L273 TraceCheckUtils]: 72: Hoare triple {12482#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12482#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,666 INFO L273 TraceCheckUtils]: 73: Hoare triple {12482#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12489#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,667 INFO L273 TraceCheckUtils]: 74: Hoare triple {12489#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12489#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,668 INFO L273 TraceCheckUtils]: 75: Hoare triple {12489#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12496#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,668 INFO L273 TraceCheckUtils]: 76: Hoare triple {12496#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12496#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,669 INFO L273 TraceCheckUtils]: 77: Hoare triple {12496#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12503#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 78: Hoare triple {12503#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12503#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 79: Hoare triple {12503#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {12510#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12510#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 81: Hoare triple {12510#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12517#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 82: Hoare triple {12517#(<= main_~i~0 11)} assume !(~i~0 < 100000); {12232#false} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 83: Hoare triple {12232#false} havoc ~x~0;~x~0 := 0; {12232#false} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 84: Hoare triple {12232#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12232#false} is VALID [2018-11-23 12:00:37,673 INFO L256 TraceCheckUtils]: 85: Hoare triple {12232#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {12232#false} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 86: Hoare triple {12232#false} ~cond := #in~cond; {12232#false} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 87: Hoare triple {12232#false} assume 0 == ~cond; {12232#false} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 88: Hoare triple {12232#false} assume !false; {12232#false} is VALID [2018-11-23 12:00:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2018-11-23 12:00:37,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:37,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14] total 41 [2018-11-23 12:00:37,704 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2018-11-23 12:00:37,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:37,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:00:37,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:37,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:00:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:00:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:00:37,805 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 41 states. [2018-11-23 12:00:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,001 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-11-23 12:00:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:00:39,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2018-11-23 12:00:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:00:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 119 transitions. [2018-11-23 12:00:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:00:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 119 transitions. [2018-11-23 12:00:39,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 119 transitions. [2018-11-23 12:00:39,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:39,222 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:00:39,222 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:00:39,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:00:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:00:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-23 12:00:39,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:39,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-23 12:00:39,273 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-23 12:00:39,273 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-23 12:00:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,274 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-23 12:00:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-11-23 12:00:39,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,275 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-23 12:00:39,275 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-23 12:00:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,276 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-23 12:00:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-11-23 12:00:39,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:39,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:39,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:39,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 12:00:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-11-23 12:00:39,278 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 89 [2018-11-23 12:00:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:39,278 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-23 12:00:39,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:00:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-11-23 12:00:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:00:39,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:39,279 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:39,279 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:39,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 768286776, now seen corresponding path program 25 times [2018-11-23 12:00:39,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:39,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {13082#true} call ULTIMATE.init(); {13082#true} is VALID [2018-11-23 12:00:39,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {13082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13082#true} is VALID [2018-11-23 12:00:39,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {13082#true} assume true; {13082#true} is VALID [2018-11-23 12:00:39,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13082#true} {13082#true} #63#return; {13082#true} is VALID [2018-11-23 12:00:39,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {13082#true} call #t~ret7 := main(); {13082#true} is VALID [2018-11-23 12:00:39,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {13082#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13084#(= main_~a~0 0)} is VALID [2018-11-23 12:00:39,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#(= 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; {13084#(= main_~a~0 0)} is VALID [2018-11-23 12:00:39,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {13084#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13085#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:39,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {13085#(<= 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; {13085#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:39,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {13085#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13086#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:39,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {13086#(<= 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; {13086#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:39,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {13086#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13087#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:39,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {13087#(<= 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; {13087#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:39,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {13087#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13088#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:39,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= 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; {13088#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:39,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {13088#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13089#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:39,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= 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; {13089#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:39,870 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13090#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:39,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= 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; {13090#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:39,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13091#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:39,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {13091#(<= 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; {13091#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:39,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:39,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {13092#(<= 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; {13092#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:39,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {13092#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13093#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:39,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {13093#(<= 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; {13093#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:39,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {13093#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13094#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:39,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {13094#(<= 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; {13094#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:39,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {13094#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13095#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:39,877 INFO L273 TraceCheckUtils]: 28: Hoare triple {13095#(<= 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; {13095#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:39,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {13095#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13096#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:39,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {13096#(<= 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; {13096#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:39,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {13096#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13097#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:39,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {13097#(<= 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; {13097#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:39,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {13097#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13098#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:39,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {13098#(<= 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; {13098#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:39,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {13098#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13099#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:39,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {13099#(<= 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; {13099#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:39,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {13099#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13100#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:39,883 INFO L273 TraceCheckUtils]: 38: Hoare triple {13100#(<= 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; {13100#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:39,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {13100#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13101#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:39,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {13101#(<= 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; {13101#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:39,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {13101#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13102#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:39,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {13102#(<= 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; {13102#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:39,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {13102#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13103#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:39,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {13103#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13103#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:39,888 INFO L273 TraceCheckUtils]: 45: Hoare triple {13103#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13104#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:39,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {13104#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13104#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:39,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {13104#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13105#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:39,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {13105#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13105#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:39,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {13105#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13106#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:39,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {13106#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13106#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:39,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {13106#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13107#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:39,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {13107#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13107#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:39,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {13107#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13108#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:39,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {13108#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13108#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:39,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {13108#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13109#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:39,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {13109#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13109#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:39,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {13109#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13110#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:39,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {13110#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13110#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:39,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {13110#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13111#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:39,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {13111#(<= main_~a~0 27)} assume !(~a~0 < 100000); {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#false} havoc ~i~0;~i~0 := 0; {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,899 INFO L273 TraceCheckUtils]: 69: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,900 INFO L273 TraceCheckUtils]: 77: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,901 INFO L273 TraceCheckUtils]: 81: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 83: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 84: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 85: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {13083#false} assume !(~i~0 < 100000); {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {13083#false} havoc ~x~0;~x~0 := 0; {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 88: Hoare triple {13083#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L256 TraceCheckUtils]: 89: Hoare triple {13083#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {13083#false} is VALID [2018-11-23 12:00:39,902 INFO L273 TraceCheckUtils]: 90: Hoare triple {13083#false} ~cond := #in~cond; {13083#false} is VALID [2018-11-23 12:00:39,903 INFO L273 TraceCheckUtils]: 91: Hoare triple {13083#false} assume 0 == ~cond; {13083#false} is VALID [2018-11-23 12:00:39,903 INFO L273 TraceCheckUtils]: 92: Hoare triple {13083#false} assume !false; {13083#false} is VALID [2018-11-23 12:00:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:00:39,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:39,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:39,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:39,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:40,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {13082#true} call ULTIMATE.init(); {13082#true} is VALID [2018-11-23 12:00:40,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {13082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13082#true} is VALID [2018-11-23 12:00:40,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {13082#true} assume true; {13082#true} is VALID [2018-11-23 12:00:40,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13082#true} {13082#true} #63#return; {13082#true} is VALID [2018-11-23 12:00:40,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {13082#true} call #t~ret7 := main(); {13082#true} is VALID [2018-11-23 12:00:40,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {13082#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13130#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:40,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {13130#(<= 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; {13130#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:40,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {13130#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13085#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:40,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {13085#(<= 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; {13085#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:40,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {13085#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13086#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:40,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {13086#(<= 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; {13086#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:40,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {13086#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13087#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:40,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {13087#(<= 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; {13087#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:40,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {13087#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13088#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:40,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= 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; {13088#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:40,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {13088#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13089#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:40,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= 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; {13089#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:40,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13090#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:40,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= 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; {13090#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:40,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13091#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:40,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {13091#(<= 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; {13091#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:40,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13092#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:40,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {13092#(<= 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; {13092#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:40,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {13092#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13093#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:40,495 INFO L273 TraceCheckUtils]: 24: Hoare triple {13093#(<= 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; {13093#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:40,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {13093#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13094#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:40,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {13094#(<= 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; {13094#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:40,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {13094#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13095#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:40,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {13095#(<= 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; {13095#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:40,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {13095#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13096#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:40,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {13096#(<= 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; {13096#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:40,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {13096#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13097#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:40,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {13097#(<= 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; {13097#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:40,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {13097#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13098#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:40,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {13098#(<= 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; {13098#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:40,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {13098#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13099#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:40,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {13099#(<= 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; {13099#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:40,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {13099#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13100#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:40,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {13100#(<= 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; {13100#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:40,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {13100#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13101#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:40,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {13101#(<= 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; {13101#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:40,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {13101#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13102#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:40,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {13102#(<= 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; {13102#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:40,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {13102#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13103#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:40,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {13103#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13103#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:40,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {13103#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13104#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:40,510 INFO L273 TraceCheckUtils]: 46: Hoare triple {13104#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13104#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:40,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {13104#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13105#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:40,511 INFO L273 TraceCheckUtils]: 48: Hoare triple {13105#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13105#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:40,511 INFO L273 TraceCheckUtils]: 49: Hoare triple {13105#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13106#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:40,512 INFO L273 TraceCheckUtils]: 50: Hoare triple {13106#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13106#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:40,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {13106#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13107#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:40,512 INFO L273 TraceCheckUtils]: 52: Hoare triple {13107#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13107#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:40,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {13107#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13108#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:40,514 INFO L273 TraceCheckUtils]: 54: Hoare triple {13108#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13108#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:40,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {13108#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13109#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:40,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {13109#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13109#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:40,516 INFO L273 TraceCheckUtils]: 57: Hoare triple {13109#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13110#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:40,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {13110#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13110#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:40,517 INFO L273 TraceCheckUtils]: 59: Hoare triple {13110#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13111#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:40,518 INFO L273 TraceCheckUtils]: 60: Hoare triple {13111#(<= main_~a~0 27)} assume !(~a~0 < 100000); {13083#false} is VALID [2018-11-23 12:00:40,518 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#false} havoc ~i~0;~i~0 := 0; {13083#false} is VALID [2018-11-23 12:00:40,518 INFO L273 TraceCheckUtils]: 62: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,518 INFO L273 TraceCheckUtils]: 63: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,518 INFO L273 TraceCheckUtils]: 64: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,519 INFO L273 TraceCheckUtils]: 65: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,519 INFO L273 TraceCheckUtils]: 66: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,519 INFO L273 TraceCheckUtils]: 67: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,519 INFO L273 TraceCheckUtils]: 68: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,519 INFO L273 TraceCheckUtils]: 69: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,520 INFO L273 TraceCheckUtils]: 73: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,520 INFO L273 TraceCheckUtils]: 74: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 75: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 77: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 78: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 79: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 80: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 81: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 82: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 84: Hoare triple {13083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {13083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 86: Hoare triple {13083#false} assume !(~i~0 < 100000); {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {13083#false} havoc ~x~0;~x~0 := 0; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 88: Hoare triple {13083#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L256 TraceCheckUtils]: 89: Hoare triple {13083#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 90: Hoare triple {13083#false} ~cond := #in~cond; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 91: Hoare triple {13083#false} assume 0 == ~cond; {13083#false} is VALID [2018-11-23 12:00:40,522 INFO L273 TraceCheckUtils]: 92: Hoare triple {13083#false} assume !false; {13083#false} is VALID [2018-11-23 12:00:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:00:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:00:40,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-11-23 12:00:40,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:40,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:00:40,623 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-23 12:00:40,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:00:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:00:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:40,624 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 31 states. [2018-11-23 12:00:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:41,541 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-23 12:00:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:00:41,542 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-11-23 12:00:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 96 transitions. [2018-11-23 12:00:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 96 transitions. [2018-11-23 12:00:41,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 96 transitions. [2018-11-23 12:00:41,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:41,640 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:00:41,640 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:00:41,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:00:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 12:00:41,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:41,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:41,706 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:41,706 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 12:00:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:41,709 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-23 12:00:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-23 12:00:41,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:41,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:41,710 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 12:00:41,710 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 12:00:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:41,711 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-23 12:00:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-23 12:00:41,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:41,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:41,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:41,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:00:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-11-23 12:00:41,714 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2018-11-23 12:00:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:41,714 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-11-23 12:00:41,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:00:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-11-23 12:00:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:00:41,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:41,715 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:41,716 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:41,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1826543146, now seen corresponding path program 26 times [2018-11-23 12:00:41,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:42,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {13945#true} call ULTIMATE.init(); {13945#true} is VALID [2018-11-23 12:00:42,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {13945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13945#true} is VALID [2018-11-23 12:00:42,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {13945#true} assume true; {13945#true} is VALID [2018-11-23 12:00:42,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13945#true} {13945#true} #63#return; {13945#true} is VALID [2018-11-23 12:00:42,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {13945#true} call #t~ret7 := main(); {13945#true} is VALID [2018-11-23 12:00:42,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {13945#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13947#(= main_~a~0 0)} is VALID [2018-11-23 12:00:42,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {13947#(= 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; {13947#(= main_~a~0 0)} is VALID [2018-11-23 12:00:42,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {13947#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13948#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:42,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {13948#(<= 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; {13948#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:42,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {13948#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13949#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:42,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {13949#(<= 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; {13949#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:42,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {13949#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13950#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:42,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {13950#(<= 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; {13950#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:42,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {13950#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13951#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:42,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {13951#(<= 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; {13951#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:42,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {13951#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13952#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:42,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {13952#(<= 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; {13952#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:42,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {13952#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13953#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:42,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {13953#(<= 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; {13953#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:42,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {13953#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13954#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:42,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {13954#(<= 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; {13954#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:42,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {13954#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13955#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:42,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {13955#(<= 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; {13955#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:42,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {13955#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13956#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:42,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {13956#(<= 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; {13956#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:42,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {13956#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13957#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:42,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {13957#(<= 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; {13957#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:42,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {13957#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13958#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:42,443 INFO L273 TraceCheckUtils]: 28: Hoare triple {13958#(<= 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; {13958#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:42,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {13958#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13959#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:42,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {13959#(<= 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; {13959#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:42,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {13959#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13960#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:42,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {13960#(<= 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; {13960#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:42,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {13960#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13961#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:42,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {13961#(<= 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; {13961#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:42,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {13961#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13962#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:42,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {13962#(<= 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; {13962#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:42,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {13962#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13963#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:42,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {13963#(<= 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; {13963#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:42,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {13963#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13964#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:42,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {13964#(<= 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; {13964#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:42,451 INFO L273 TraceCheckUtils]: 41: Hoare triple {13964#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13965#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:42,452 INFO L273 TraceCheckUtils]: 42: Hoare triple {13965#(<= 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; {13965#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:42,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {13965#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13966#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:42,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {13966#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13966#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:42,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {13966#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13967#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:42,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {13967#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13967#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:42,455 INFO L273 TraceCheckUtils]: 47: Hoare triple {13967#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13968#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:42,455 INFO L273 TraceCheckUtils]: 48: Hoare triple {13968#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13968#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:42,456 INFO L273 TraceCheckUtils]: 49: Hoare triple {13968#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13969#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:42,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {13969#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13969#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:42,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {13969#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13970#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:42,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {13970#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13970#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:42,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {13970#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13971#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:42,459 INFO L273 TraceCheckUtils]: 54: Hoare triple {13971#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13971#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:42,460 INFO L273 TraceCheckUtils]: 55: Hoare triple {13971#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13972#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:42,460 INFO L273 TraceCheckUtils]: 56: Hoare triple {13972#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13972#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:42,461 INFO L273 TraceCheckUtils]: 57: Hoare triple {13972#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13973#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:42,461 INFO L273 TraceCheckUtils]: 58: Hoare triple {13973#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13973#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:42,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {13973#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13974#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:42,463 INFO L273 TraceCheckUtils]: 60: Hoare triple {13974#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13974#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:42,463 INFO L273 TraceCheckUtils]: 61: Hoare triple {13974#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13975#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 62: Hoare triple {13975#(<= main_~a~0 28)} assume !(~a~0 < 100000); {13946#false} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {13946#false} havoc ~i~0;~i~0 := 0; {13946#false} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 69: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,465 INFO L273 TraceCheckUtils]: 70: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 71: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 72: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 73: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 74: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,466 INFO L273 TraceCheckUtils]: 75: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 76: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 77: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 78: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 79: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 80: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,467 INFO L273 TraceCheckUtils]: 81: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 82: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 83: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 85: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 86: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 87: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,468 INFO L273 TraceCheckUtils]: 88: Hoare triple {13946#false} assume !(~i~0 < 100000); {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 89: Hoare triple {13946#false} havoc ~x~0;~x~0 := 0; {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 90: Hoare triple {13946#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L256 TraceCheckUtils]: 91: Hoare triple {13946#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 92: Hoare triple {13946#false} ~cond := #in~cond; {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 93: Hoare triple {13946#false} assume 0 == ~cond; {13946#false} is VALID [2018-11-23 12:00:42,469 INFO L273 TraceCheckUtils]: 94: Hoare triple {13946#false} assume !false; {13946#false} is VALID [2018-11-23 12:00:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:00:42,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:42,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:42,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:42,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:42,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:42,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {13945#true} call ULTIMATE.init(); {13945#true} is VALID [2018-11-23 12:00:42,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {13945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13945#true} is VALID [2018-11-23 12:00:42,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {13945#true} assume true; {13945#true} is VALID [2018-11-23 12:00:42,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13945#true} {13945#true} #63#return; {13945#true} is VALID [2018-11-23 12:00:42,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {13945#true} call #t~ret7 := main(); {13945#true} is VALID [2018-11-23 12:00:42,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {13945#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13994#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:42,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {13994#(<= 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; {13994#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:42,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {13994#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13948#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:42,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {13948#(<= 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; {13948#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:42,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {13948#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13949#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:42,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {13949#(<= 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; {13949#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:42,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {13949#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13950#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:42,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {13950#(<= 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; {13950#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:42,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {13950#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13951#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:42,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {13951#(<= 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; {13951#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:42,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {13951#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13952#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:42,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {13952#(<= 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; {13952#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:42,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {13952#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13953#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:42,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {13953#(<= 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; {13953#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:42,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {13953#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13954#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:42,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {13954#(<= 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; {13954#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:42,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {13954#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13955#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:42,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {13955#(<= 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; {13955#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:42,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {13955#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13956#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:42,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {13956#(<= 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; {13956#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:42,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {13956#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13957#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:42,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {13957#(<= 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; {13957#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:42,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {13957#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13958#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:42,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {13958#(<= 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; {13958#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:42,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {13958#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13959#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:42,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {13959#(<= 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; {13959#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:42,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {13959#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13960#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:42,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {13960#(<= 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; {13960#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:42,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {13960#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13961#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:42,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {13961#(<= 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; {13961#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:42,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {13961#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13962#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:42,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {13962#(<= 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; {13962#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:42,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {13962#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13963#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:42,808 INFO L273 TraceCheckUtils]: 38: Hoare triple {13963#(<= 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; {13963#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:42,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {13963#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13964#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:42,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {13964#(<= 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; {13964#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:42,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {13964#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13965#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:42,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {13965#(<= 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; {13965#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:42,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {13965#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13966#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:42,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {13966#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13966#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:42,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {13966#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13967#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:42,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {13967#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13967#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:42,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {13967#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13968#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:42,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {13968#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13968#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:42,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {13968#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13969#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:42,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {13969#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13969#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:42,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {13969#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13970#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:42,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {13970#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13970#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:42,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {13970#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13971#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:42,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {13971#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13971#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:42,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {13971#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13972#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:42,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {13972#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13972#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:42,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {13972#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13973#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:42,820 INFO L273 TraceCheckUtils]: 58: Hoare triple {13973#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13973#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:42,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {13973#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13974#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:42,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {13974#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13974#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:42,822 INFO L273 TraceCheckUtils]: 61: Hoare triple {13974#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13975#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:42,823 INFO L273 TraceCheckUtils]: 62: Hoare triple {13975#(<= main_~a~0 28)} assume !(~a~0 < 100000); {13946#false} is VALID [2018-11-23 12:00:42,823 INFO L273 TraceCheckUtils]: 63: Hoare triple {13946#false} havoc ~i~0;~i~0 := 0; {13946#false} is VALID [2018-11-23 12:00:42,823 INFO L273 TraceCheckUtils]: 64: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 68: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 69: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 70: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,824 INFO L273 TraceCheckUtils]: 71: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,825 INFO L273 TraceCheckUtils]: 72: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,825 INFO L273 TraceCheckUtils]: 73: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,825 INFO L273 TraceCheckUtils]: 74: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,825 INFO L273 TraceCheckUtils]: 75: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,825 INFO L273 TraceCheckUtils]: 76: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 77: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 78: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 79: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 80: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 81: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,826 INFO L273 TraceCheckUtils]: 82: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 83: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 85: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 86: Hoare triple {13946#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 87: Hoare triple {13946#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13946#false} is VALID [2018-11-23 12:00:42,827 INFO L273 TraceCheckUtils]: 88: Hoare triple {13946#false} assume !(~i~0 < 100000); {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L273 TraceCheckUtils]: 89: Hoare triple {13946#false} havoc ~x~0;~x~0 := 0; {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L273 TraceCheckUtils]: 90: Hoare triple {13946#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L256 TraceCheckUtils]: 91: Hoare triple {13946#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L273 TraceCheckUtils]: 92: Hoare triple {13946#false} ~cond := #in~cond; {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L273 TraceCheckUtils]: 93: Hoare triple {13946#false} assume 0 == ~cond; {13946#false} is VALID [2018-11-23 12:00:42,828 INFO L273 TraceCheckUtils]: 94: Hoare triple {13946#false} assume !false; {13946#false} is VALID [2018-11-23 12:00:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:00:42,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:42,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:00:42,853 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-11-23 12:00:42,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:42,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:00:42,925 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-23 12:00:42,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:00:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:00:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:00:42,926 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 32 states. [2018-11-23 12:00:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:43,850 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-11-23 12:00:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:00:43,851 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-11-23 12:00:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:00:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2018-11-23 12:00:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:00:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2018-11-23 12:00:43,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 98 transitions. [2018-11-23 12:00:43,967 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-23 12:00:43,969 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:00:43,969 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:00:43,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:00:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:00:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-23 12:00:44,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:44,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:44,047 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:44,047 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 102 states. [2018-11-23 12:00:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:44,049 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-23 12:00:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-23 12:00:44,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:44,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:44,049 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 103 states. [2018-11-23 12:00:44,049 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 103 states. [2018-11-23 12:00:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:44,051 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-23 12:00:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-23 12:00:44,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:44,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:44,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:44,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:00:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-11-23 12:00:44,052 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2018-11-23 12:00:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:44,053 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-11-23 12:00:44,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:00:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-11-23 12:00:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:00:44,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:44,053 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:44,054 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:44,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -82099212, now seen corresponding path program 27 times [2018-11-23 12:00:44,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:44,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:44,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:45,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {14825#true} call ULTIMATE.init(); {14825#true} is VALID [2018-11-23 12:00:45,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {14825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14825#true} is VALID [2018-11-23 12:00:45,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {14825#true} assume true; {14825#true} is VALID [2018-11-23 12:00:45,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14825#true} {14825#true} #63#return; {14825#true} is VALID [2018-11-23 12:00:45,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {14825#true} call #t~ret7 := main(); {14825#true} is VALID [2018-11-23 12:00:45,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {14825#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14827#(= main_~a~0 0)} is VALID [2018-11-23 12:00:45,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {14827#(= 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; {14827#(= main_~a~0 0)} is VALID [2018-11-23 12:00:45,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {14827#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14828#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:45,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {14828#(<= 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; {14828#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:45,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {14828#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14829#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:45,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {14829#(<= 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; {14829#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:45,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {14829#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14830#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:45,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {14830#(<= 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; {14830#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:45,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {14830#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14831#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:45,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {14831#(<= 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; {14831#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:45,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {14831#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14832#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:45,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {14832#(<= 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; {14832#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:45,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {14832#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14833#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:45,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {14833#(<= 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; {14833#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:45,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {14833#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14834#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:45,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {14834#(<= 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; {14834#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:45,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {14834#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14835#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:45,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {14835#(<= 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; {14835#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:45,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {14835#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14836#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:45,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {14836#(<= 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; {14836#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:45,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {14836#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14837#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:45,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {14837#(<= 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; {14837#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:45,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {14837#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14838#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:45,676 INFO L273 TraceCheckUtils]: 28: Hoare triple {14838#(<= 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; {14838#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:45,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {14838#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14839#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:45,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {14839#(<= 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; {14839#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:45,678 INFO L273 TraceCheckUtils]: 31: Hoare triple {14839#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14840#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:45,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {14840#(<= 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; {14840#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:45,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {14840#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14841#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:45,680 INFO L273 TraceCheckUtils]: 34: Hoare triple {14841#(<= 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; {14841#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:45,681 INFO L273 TraceCheckUtils]: 35: Hoare triple {14841#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14842#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:45,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {14842#(<= 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; {14842#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:45,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {14842#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14843#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:45,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {14843#(<= 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; {14843#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:45,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {14843#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14844#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:45,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {14844#(<= 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; {14844#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:45,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {14844#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14845#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:45,685 INFO L273 TraceCheckUtils]: 42: Hoare triple {14845#(<= 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; {14845#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:45,685 INFO L273 TraceCheckUtils]: 43: Hoare triple {14845#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14846#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:45,686 INFO L273 TraceCheckUtils]: 44: Hoare triple {14846#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14846#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:45,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {14846#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14847#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:45,687 INFO L273 TraceCheckUtils]: 46: Hoare triple {14847#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14847#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:45,688 INFO L273 TraceCheckUtils]: 47: Hoare triple {14847#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14848#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:45,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {14848#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14848#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:45,689 INFO L273 TraceCheckUtils]: 49: Hoare triple {14848#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14849#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:45,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {14849#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14849#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:45,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {14849#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14850#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:45,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {14850#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14850#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:45,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {14850#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14851#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:45,692 INFO L273 TraceCheckUtils]: 54: Hoare triple {14851#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14851#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:45,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {14851#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14852#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:45,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {14852#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14852#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:45,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {14852#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14853#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:45,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {14853#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14853#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:45,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {14853#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14854#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:45,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {14854#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14854#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:45,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {14854#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14855#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:45,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {14855#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14855#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:45,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {14855#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14856#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:45,699 INFO L273 TraceCheckUtils]: 64: Hoare triple {14856#(<= main_~a~0 29)} assume !(~a~0 < 100000); {14826#false} is VALID [2018-11-23 12:00:45,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {14826#false} havoc ~i~0;~i~0 := 0; {14826#false} is VALID [2018-11-23 12:00:45,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,699 INFO L273 TraceCheckUtils]: 67: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,700 INFO L273 TraceCheckUtils]: 69: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,700 INFO L273 TraceCheckUtils]: 71: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,700 INFO L273 TraceCheckUtils]: 72: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 73: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 74: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 75: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 76: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,701 INFO L273 TraceCheckUtils]: 79: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 81: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 82: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 83: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 84: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 85: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 86: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 87: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,702 INFO L273 TraceCheckUtils]: 88: Hoare triple {14826#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 89: Hoare triple {14826#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 90: Hoare triple {14826#false} assume !(~i~0 < 100000); {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {14826#false} havoc ~x~0;~x~0 := 0; {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 92: Hoare triple {14826#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L256 TraceCheckUtils]: 93: Hoare triple {14826#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 94: Hoare triple {14826#false} ~cond := #in~cond; {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 95: Hoare triple {14826#false} assume 0 == ~cond; {14826#false} is VALID [2018-11-23 12:00:45,703 INFO L273 TraceCheckUtils]: 96: Hoare triple {14826#false} assume !false; {14826#false} is VALID [2018-11-23 12:00:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:00:45,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:45,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:47,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:00:47,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:47,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:47,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {14825#true} call ULTIMATE.init(); {14825#true} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {14825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14825#true} is VALID [2018-11-23 12:00:47,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {14825#true} assume true; {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14825#true} {14825#true} #63#return; {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {14825#true} call #t~ret7 := main(); {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {14825#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 29: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 32: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 42: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 43: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 45: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 50: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 51: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,880 INFO L273 TraceCheckUtils]: 52: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 53: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 54: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 55: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 58: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {14825#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; {14825#true} is VALID [2018-11-23 12:00:47,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {14825#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14825#true} is VALID [2018-11-23 12:00:47,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {14825#true} assume !(~a~0 < 100000); {14825#true} is VALID [2018-11-23 12:00:47,882 INFO L273 TraceCheckUtils]: 65: Hoare triple {14825#true} havoc ~i~0;~i~0 := 0; {15055#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:47,882 INFO L273 TraceCheckUtils]: 66: Hoare triple {15055#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15055#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:47,883 INFO L273 TraceCheckUtils]: 67: Hoare triple {15055#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15062#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:47,883 INFO L273 TraceCheckUtils]: 68: Hoare triple {15062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15062#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:47,884 INFO L273 TraceCheckUtils]: 69: Hoare triple {15062#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15069#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,884 INFO L273 TraceCheckUtils]: 70: Hoare triple {15069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15069#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,884 INFO L273 TraceCheckUtils]: 71: Hoare triple {15069#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15076#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,885 INFO L273 TraceCheckUtils]: 72: Hoare triple {15076#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15076#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,885 INFO L273 TraceCheckUtils]: 73: Hoare triple {15076#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15083#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {15083#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15083#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {15083#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15090#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,887 INFO L273 TraceCheckUtils]: 76: Hoare triple {15090#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15090#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,887 INFO L273 TraceCheckUtils]: 77: Hoare triple {15090#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15097#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,888 INFO L273 TraceCheckUtils]: 78: Hoare triple {15097#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15097#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,889 INFO L273 TraceCheckUtils]: 79: Hoare triple {15097#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15104#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,889 INFO L273 TraceCheckUtils]: 80: Hoare triple {15104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15104#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,890 INFO L273 TraceCheckUtils]: 81: Hoare triple {15104#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15111#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,890 INFO L273 TraceCheckUtils]: 82: Hoare triple {15111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15111#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,891 INFO L273 TraceCheckUtils]: 83: Hoare triple {15111#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15118#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,891 INFO L273 TraceCheckUtils]: 84: Hoare triple {15118#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15118#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,892 INFO L273 TraceCheckUtils]: 85: Hoare triple {15118#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,893 INFO L273 TraceCheckUtils]: 86: Hoare triple {15125#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,893 INFO L273 TraceCheckUtils]: 87: Hoare triple {15125#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15132#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,894 INFO L273 TraceCheckUtils]: 88: Hoare triple {15132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15132#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,895 INFO L273 TraceCheckUtils]: 89: Hoare triple {15132#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15139#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,895 INFO L273 TraceCheckUtils]: 90: Hoare triple {15139#(<= main_~i~0 12)} assume !(~i~0 < 100000); {14826#false} is VALID [2018-11-23 12:00:47,895 INFO L273 TraceCheckUtils]: 91: Hoare triple {14826#false} havoc ~x~0;~x~0 := 0; {14826#false} is VALID [2018-11-23 12:00:47,896 INFO L273 TraceCheckUtils]: 92: Hoare triple {14826#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14826#false} is VALID [2018-11-23 12:00:47,896 INFO L256 TraceCheckUtils]: 93: Hoare triple {14826#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {14826#false} is VALID [2018-11-23 12:00:47,896 INFO L273 TraceCheckUtils]: 94: Hoare triple {14826#false} ~cond := #in~cond; {14826#false} is VALID [2018-11-23 12:00:47,896 INFO L273 TraceCheckUtils]: 95: Hoare triple {14826#false} assume 0 == ~cond; {14826#false} is VALID [2018-11-23 12:00:47,896 INFO L273 TraceCheckUtils]: 96: Hoare triple {14826#false} assume !false; {14826#false} is VALID [2018-11-23 12:00:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2018-11-23 12:00:47,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:47,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 15] total 45 [2018-11-23 12:00:47,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 97 [2018-11-23 12:00:47,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:47,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:00:48,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:48,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:00:48,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:00:48,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1380, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:00:48,031 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 45 states. [2018-11-23 12:00:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,570 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2018-11-23 12:00:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:00:49,570 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 97 [2018-11-23 12:00:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 127 transitions. [2018-11-23 12:00:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 127 transitions. [2018-11-23 12:00:49,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 127 transitions. [2018-11-23 12:00:49,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:49,698 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:00:49,698 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:00:49,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=600, Invalid=1380, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:00:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:00:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-23 12:00:49,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:49,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 106 states. [2018-11-23 12:00:49,757 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 106 states. [2018-11-23 12:00:49,758 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 106 states. [2018-11-23 12:00:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,760 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-23 12:00:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-11-23 12:00:49,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,761 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 108 states. [2018-11-23 12:00:49,761 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 108 states. [2018-11-23 12:00:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,763 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-23 12:00:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-11-23 12:00:49,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:49,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:00:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-11-23 12:00:49,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 97 [2018-11-23 12:00:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:49,766 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-11-23 12:00:49,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:00:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-11-23 12:00:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:00:49,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:49,767 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:49,767 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:49,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash -299435664, now seen corresponding path program 28 times [2018-11-23 12:00:49,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:50,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {15747#true} call ULTIMATE.init(); {15747#true} is VALID [2018-11-23 12:00:50,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {15747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15747#true} is VALID [2018-11-23 12:00:50,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {15747#true} assume true; {15747#true} is VALID [2018-11-23 12:00:50,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15747#true} {15747#true} #63#return; {15747#true} is VALID [2018-11-23 12:00:50,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {15747#true} call #t~ret7 := main(); {15747#true} is VALID [2018-11-23 12:00:50,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {15747#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15749#(= main_~a~0 0)} is VALID [2018-11-23 12:00:50,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {15749#(= 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; {15749#(= main_~a~0 0)} is VALID [2018-11-23 12:00:50,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {15749#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15750#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:50,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {15750#(<= 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; {15750#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:50,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {15750#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15751#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:50,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {15751#(<= 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; {15751#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:50,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {15751#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15752#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:50,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {15752#(<= 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; {15752#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:50,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {15752#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15753#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:50,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {15753#(<= 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; {15753#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:50,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {15753#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15754#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:50,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {15754#(<= 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; {15754#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:50,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {15754#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15755#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:50,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {15755#(<= 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; {15755#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:50,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {15755#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15756#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:50,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {15756#(<= 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; {15756#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:50,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {15756#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15757#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:50,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {15757#(<= 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; {15757#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:50,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {15757#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15758#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:50,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {15758#(<= 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; {15758#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:50,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {15758#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15759#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:50,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {15759#(<= 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; {15759#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:50,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {15759#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15760#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:50,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {15760#(<= 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; {15760#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:50,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {15760#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15761#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:50,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {15761#(<= 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; {15761#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:50,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {15761#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15762#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:50,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {15762#(<= 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; {15762#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:50,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {15762#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15763#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:50,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {15763#(<= 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; {15763#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:50,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {15763#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15764#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:50,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {15764#(<= 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; {15764#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:50,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {15764#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15765#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:50,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {15765#(<= 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; {15765#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:50,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {15765#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15766#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:50,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {15766#(<= 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; {15766#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:50,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {15766#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15767#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:50,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {15767#(<= 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; {15767#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:50,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {15767#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15768#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:50,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {15768#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15768#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:50,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {15768#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15769#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:50,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {15769#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15769#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:50,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {15769#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15770#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:50,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {15770#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15770#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:50,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {15770#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15771#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:50,537 INFO L273 TraceCheckUtils]: 50: Hoare triple {15771#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15771#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:50,537 INFO L273 TraceCheckUtils]: 51: Hoare triple {15771#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15772#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:50,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {15772#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15772#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:50,538 INFO L273 TraceCheckUtils]: 53: Hoare triple {15772#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15773#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:50,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {15773#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15773#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:50,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {15773#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15774#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:50,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {15774#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15774#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:50,541 INFO L273 TraceCheckUtils]: 57: Hoare triple {15774#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15775#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:50,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {15775#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15775#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:50,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {15775#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15776#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:50,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {15776#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15776#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:50,545 INFO L273 TraceCheckUtils]: 61: Hoare triple {15776#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15777#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:50,547 INFO L273 TraceCheckUtils]: 62: Hoare triple {15777#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15777#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:50,547 INFO L273 TraceCheckUtils]: 63: Hoare triple {15777#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15778#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:50,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {15778#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15778#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:50,549 INFO L273 TraceCheckUtils]: 65: Hoare triple {15778#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15779#(<= main_~a~0 30)} is VALID [2018-11-23 12:00:50,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {15779#(<= main_~a~0 30)} assume !(~a~0 < 100000); {15748#false} is VALID [2018-11-23 12:00:50,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {15748#false} havoc ~i~0;~i~0 := 0; {15748#false} is VALID [2018-11-23 12:00:50,551 INFO L273 TraceCheckUtils]: 68: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,551 INFO L273 TraceCheckUtils]: 69: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,552 INFO L273 TraceCheckUtils]: 70: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,552 INFO L273 TraceCheckUtils]: 71: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,552 INFO L273 TraceCheckUtils]: 72: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 78: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 79: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,553 INFO L273 TraceCheckUtils]: 80: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,554 INFO L273 TraceCheckUtils]: 81: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,554 INFO L273 TraceCheckUtils]: 82: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,554 INFO L273 TraceCheckUtils]: 83: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,555 INFO L273 TraceCheckUtils]: 89: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 93: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 94: Hoare triple {15748#false} assume !(~i~0 < 100000); {15748#false} is VALID [2018-11-23 12:00:50,556 INFO L273 TraceCheckUtils]: 95: Hoare triple {15748#false} havoc ~x~0;~x~0 := 0; {15748#false} is VALID [2018-11-23 12:00:50,557 INFO L273 TraceCheckUtils]: 96: Hoare triple {15748#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15748#false} is VALID [2018-11-23 12:00:50,557 INFO L256 TraceCheckUtils]: 97: Hoare triple {15748#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {15748#false} is VALID [2018-11-23 12:00:50,557 INFO L273 TraceCheckUtils]: 98: Hoare triple {15748#false} ~cond := #in~cond; {15748#false} is VALID [2018-11-23 12:00:50,557 INFO L273 TraceCheckUtils]: 99: Hoare triple {15748#false} assume 0 == ~cond; {15748#false} is VALID [2018-11-23 12:00:50,557 INFO L273 TraceCheckUtils]: 100: Hoare triple {15748#false} assume !false; {15748#false} is VALID [2018-11-23 12:00:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:00:50,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:50,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:50,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:50,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:50,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:50,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:51,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {15747#true} call ULTIMATE.init(); {15747#true} is VALID [2018-11-23 12:00:51,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {15747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15747#true} is VALID [2018-11-23 12:00:51,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {15747#true} assume true; {15747#true} is VALID [2018-11-23 12:00:51,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15747#true} {15747#true} #63#return; {15747#true} is VALID [2018-11-23 12:00:51,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {15747#true} call #t~ret7 := main(); {15747#true} is VALID [2018-11-23 12:00:51,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {15747#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15798#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:51,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {15798#(<= 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; {15798#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:51,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {15798#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15750#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:51,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {15750#(<= 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; {15750#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:51,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {15750#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15751#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:51,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {15751#(<= 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; {15751#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:51,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {15751#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15752#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:51,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {15752#(<= 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; {15752#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:51,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {15752#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15753#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:51,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {15753#(<= 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; {15753#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:51,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {15753#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15754#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:51,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {15754#(<= 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; {15754#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:51,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {15754#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15755#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:51,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {15755#(<= 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; {15755#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:51,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {15755#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15756#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:51,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {15756#(<= 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; {15756#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:51,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {15756#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15757#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:51,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {15757#(<= 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; {15757#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:51,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {15757#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15758#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:51,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {15758#(<= 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; {15758#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:51,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {15758#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15759#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:51,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {15759#(<= 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; {15759#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:51,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {15759#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15760#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:51,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {15760#(<= 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; {15760#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:51,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {15760#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15761#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:51,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {15761#(<= 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; {15761#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:51,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {15761#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15762#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:51,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {15762#(<= 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; {15762#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:51,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {15762#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15763#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:51,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {15763#(<= 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; {15763#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:51,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {15763#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15764#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:51,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {15764#(<= 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; {15764#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:51,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {15764#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15765#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:51,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {15765#(<= 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; {15765#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:51,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {15765#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15766#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:51,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {15766#(<= 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; {15766#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:51,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {15766#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15767#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:51,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {15767#(<= 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; {15767#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:51,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {15767#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15768#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:51,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {15768#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15768#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:51,058 INFO L273 TraceCheckUtils]: 45: Hoare triple {15768#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15769#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:51,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {15769#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15769#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:51,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {15769#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15770#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:51,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {15770#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15770#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:51,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {15770#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15771#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:51,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {15771#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15771#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:51,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {15771#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15772#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:51,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {15772#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15772#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:51,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {15772#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15773#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:51,063 INFO L273 TraceCheckUtils]: 54: Hoare triple {15773#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15773#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:51,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {15773#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15774#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:51,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {15774#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15774#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:51,065 INFO L273 TraceCheckUtils]: 57: Hoare triple {15774#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15775#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:51,065 INFO L273 TraceCheckUtils]: 58: Hoare triple {15775#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15775#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:51,066 INFO L273 TraceCheckUtils]: 59: Hoare triple {15775#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15776#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:51,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {15776#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15776#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:51,067 INFO L273 TraceCheckUtils]: 61: Hoare triple {15776#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15777#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:51,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {15777#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15777#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:51,069 INFO L273 TraceCheckUtils]: 63: Hoare triple {15777#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15778#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:51,069 INFO L273 TraceCheckUtils]: 64: Hoare triple {15778#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15778#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:51,070 INFO L273 TraceCheckUtils]: 65: Hoare triple {15778#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15779#(<= main_~a~0 30)} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 66: Hoare triple {15779#(<= main_~a~0 30)} assume !(~a~0 < 100000); {15748#false} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 67: Hoare triple {15748#false} havoc ~i~0;~i~0 := 0; {15748#false} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 68: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 72: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 73: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 74: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 76: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 79: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 80: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,073 INFO L273 TraceCheckUtils]: 81: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 83: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 84: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 85: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 86: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 87: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 88: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 89: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,074 INFO L273 TraceCheckUtils]: 90: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 91: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 92: Hoare triple {15748#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 93: Hoare triple {15748#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 94: Hoare triple {15748#false} assume !(~i~0 < 100000); {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 95: Hoare triple {15748#false} havoc ~x~0;~x~0 := 0; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 96: Hoare triple {15748#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L256 TraceCheckUtils]: 97: Hoare triple {15748#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 98: Hoare triple {15748#false} ~cond := #in~cond; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 99: Hoare triple {15748#false} assume 0 == ~cond; {15748#false} is VALID [2018-11-23 12:00:51,075 INFO L273 TraceCheckUtils]: 100: Hoare triple {15748#false} assume !false; {15748#false} is VALID [2018-11-23 12:00:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:00:51,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:51,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:00:51,101 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-23 12:00:51,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:51,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:00:51,182 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-23 12:00:51,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:00:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:00:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:00:51,183 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 34 states. [2018-11-23 12:00:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:51,845 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:00:51,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:00:51,845 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-23 12:00:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:00:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 102 transitions. [2018-11-23 12:00:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:00:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 102 transitions. [2018-11-23 12:00:51,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 102 transitions. [2018-11-23 12:00:51,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:51,946 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:00:51,946 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:00:51,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:00:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:00:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-23 12:00:52,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:52,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 108 states. [2018-11-23 12:00:52,018 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 108 states. [2018-11-23 12:00:52,019 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 108 states. [2018-11-23 12:00:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:52,020 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-11-23 12:00:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-11-23 12:00:52,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:52,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:52,021 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 109 states. [2018-11-23 12:00:52,021 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 109 states. [2018-11-23 12:00:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:52,023 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-11-23 12:00:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-11-23 12:00:52,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:52,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:52,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:52,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:00:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-11-23 12:00:52,026 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 101 [2018-11-23 12:00:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:52,026 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-11-23 12:00:52,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:00:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-11-23 12:00:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:00:52,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:52,027 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:52,027 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:52,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2019523314, now seen corresponding path program 29 times [2018-11-23 12:00:52,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:52,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:52,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:52,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {16680#true} call ULTIMATE.init(); {16680#true} is VALID [2018-11-23 12:00:52,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {16680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16680#true} is VALID [2018-11-23 12:00:52,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {16680#true} assume true; {16680#true} is VALID [2018-11-23 12:00:52,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16680#true} {16680#true} #63#return; {16680#true} is VALID [2018-11-23 12:00:52,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {16680#true} call #t~ret7 := main(); {16680#true} is VALID [2018-11-23 12:00:52,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {16680#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16682#(= main_~a~0 0)} is VALID [2018-11-23 12:00:52,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {16682#(= 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; {16682#(= main_~a~0 0)} is VALID [2018-11-23 12:00:52,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {16682#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16683#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:52,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {16683#(<= 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; {16683#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:52,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {16683#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16684#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:52,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {16684#(<= 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; {16684#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:52,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {16684#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16685#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:52,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {16685#(<= 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; {16685#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:52,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {16685#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16686#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:52,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {16686#(<= 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; {16686#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:52,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {16686#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16687#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:52,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {16687#(<= 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; {16687#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:52,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {16687#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16688#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:52,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {16688#(<= 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; {16688#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:52,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {16688#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16689#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:52,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {16689#(<= 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; {16689#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:52,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {16689#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16690#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:52,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {16690#(<= 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; {16690#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:52,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {16690#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16691#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:52,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {16691#(<= 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; {16691#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:52,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {16691#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16692#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:52,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {16692#(<= 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; {16692#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:52,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {16692#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16693#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:52,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {16693#(<= 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; {16693#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:52,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {16693#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16694#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:52,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {16694#(<= 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; {16694#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:52,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {16694#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16695#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:52,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {16695#(<= 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; {16695#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:52,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {16695#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16696#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:52,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {16696#(<= 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; {16696#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:52,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {16696#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16697#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:52,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {16697#(<= 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; {16697#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:52,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {16697#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16698#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:52,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {16698#(<= 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; {16698#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:52,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {16698#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16699#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:52,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {16699#(<= 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; {16699#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:52,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {16699#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16700#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:52,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {16700#(<= 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; {16700#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:52,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {16700#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16701#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:52,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {16701#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16701#(<= main_~a~0 19)} is VALID [2018-11-23 12:00:52,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {16701#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16702#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:52,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {16702#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16702#(<= main_~a~0 20)} is VALID [2018-11-23 12:00:52,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {16702#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16703#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:52,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {16703#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16703#(<= main_~a~0 21)} is VALID [2018-11-23 12:00:52,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {16703#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16704#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:52,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {16704#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16704#(<= main_~a~0 22)} is VALID [2018-11-23 12:00:52,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {16704#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16705#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:52,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {16705#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16705#(<= main_~a~0 23)} is VALID [2018-11-23 12:00:52,709 INFO L273 TraceCheckUtils]: 53: Hoare triple {16705#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16706#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:52,709 INFO L273 TraceCheckUtils]: 54: Hoare triple {16706#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16706#(<= main_~a~0 24)} is VALID [2018-11-23 12:00:52,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {16706#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16707#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:52,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {16707#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16707#(<= main_~a~0 25)} is VALID [2018-11-23 12:00:52,711 INFO L273 TraceCheckUtils]: 57: Hoare triple {16707#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16708#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:52,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {16708#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16708#(<= main_~a~0 26)} is VALID [2018-11-23 12:00:52,713 INFO L273 TraceCheckUtils]: 59: Hoare triple {16708#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16709#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:52,713 INFO L273 TraceCheckUtils]: 60: Hoare triple {16709#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16709#(<= main_~a~0 27)} is VALID [2018-11-23 12:00:52,714 INFO L273 TraceCheckUtils]: 61: Hoare triple {16709#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16710#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:52,714 INFO L273 TraceCheckUtils]: 62: Hoare triple {16710#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16710#(<= main_~a~0 28)} is VALID [2018-11-23 12:00:52,715 INFO L273 TraceCheckUtils]: 63: Hoare triple {16710#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16711#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:52,716 INFO L273 TraceCheckUtils]: 64: Hoare triple {16711#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16711#(<= main_~a~0 29)} is VALID [2018-11-23 12:00:52,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {16711#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16712#(<= main_~a~0 30)} is VALID [2018-11-23 12:00:52,717 INFO L273 TraceCheckUtils]: 66: Hoare triple {16712#(<= main_~a~0 30)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16712#(<= main_~a~0 30)} is VALID [2018-11-23 12:00:52,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {16712#(<= main_~a~0 30)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16713#(<= main_~a~0 31)} is VALID [2018-11-23 12:00:52,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {16713#(<= main_~a~0 31)} assume !(~a~0 < 100000); {16681#false} is VALID [2018-11-23 12:00:52,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {16681#false} havoc ~i~0;~i~0 := 0; {16681#false} is VALID [2018-11-23 12:00:52,719 INFO L273 TraceCheckUtils]: 70: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,719 INFO L273 TraceCheckUtils]: 72: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,719 INFO L273 TraceCheckUtils]: 73: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,720 INFO L273 TraceCheckUtils]: 77: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,722 INFO L273 TraceCheckUtils]: 85: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 90: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 91: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:00:52,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 96: Hoare triple {16681#false} assume !(~i~0 < 100000); {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 97: Hoare triple {16681#false} havoc ~x~0;~x~0 := 0; {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 98: Hoare triple {16681#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L256 TraceCheckUtils]: 99: Hoare triple {16681#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 100: Hoare triple {16681#false} ~cond := #in~cond; {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {16681#false} assume 0 == ~cond; {16681#false} is VALID [2018-11-23 12:00:52,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {16681#false} assume !false; {16681#false} is VALID [2018-11-23 12:00:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:00:52,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:52,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:52,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:00,597 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-11-23 12:02:00,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:00,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:00,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {16680#true} call ULTIMATE.init(); {16680#true} is VALID [2018-11-23 12:02:00,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {16680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16680#true} is VALID [2018-11-23 12:02:00,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {16680#true} assume true; {16680#true} is VALID [2018-11-23 12:02:00,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16680#true} {16680#true} #63#return; {16680#true} is VALID [2018-11-23 12:02:00,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {16680#true} call #t~ret7 := main(); {16680#true} is VALID [2018-11-23 12:02:00,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {16680#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16732#(<= main_~a~0 0)} is VALID [2018-11-23 12:02:00,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {16732#(<= 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; {16732#(<= main_~a~0 0)} is VALID [2018-11-23 12:02:00,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {16732#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16683#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:00,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {16683#(<= 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; {16683#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:00,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {16683#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16684#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:00,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {16684#(<= 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; {16684#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:00,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {16684#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16685#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:00,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {16685#(<= 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; {16685#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:00,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {16685#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16686#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:00,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {16686#(<= 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; {16686#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:00,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {16686#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16687#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:00,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {16687#(<= 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; {16687#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:00,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {16687#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16688#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:00,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {16688#(<= 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; {16688#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:00,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {16688#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16689#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:00,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {16689#(<= 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; {16689#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:00,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {16689#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16690#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:00,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {16690#(<= 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; {16690#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:00,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {16690#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16691#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:00,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {16691#(<= 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; {16691#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:00,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {16691#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16692#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:00,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {16692#(<= 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; {16692#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:00,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {16692#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16693#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:00,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {16693#(<= 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; {16693#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:00,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {16693#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16694#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:00,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {16694#(<= 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; {16694#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:00,898 INFO L273 TraceCheckUtils]: 31: Hoare triple {16694#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16695#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:00,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {16695#(<= 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; {16695#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:00,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {16695#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16696#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:00,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {16696#(<= 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; {16696#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:00,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {16696#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16697#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:00,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {16697#(<= 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; {16697#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:00,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {16697#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16698#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:00,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {16698#(<= 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; {16698#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:00,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {16698#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16699#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:00,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {16699#(<= 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; {16699#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:00,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {16699#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16700#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:00,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {16700#(<= 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; {16700#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:00,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {16700#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16701#(<= main_~a~0 19)} is VALID [2018-11-23 12:02:00,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {16701#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16701#(<= main_~a~0 19)} is VALID [2018-11-23 12:02:00,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {16701#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16702#(<= main_~a~0 20)} is VALID [2018-11-23 12:02:00,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {16702#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16702#(<= main_~a~0 20)} is VALID [2018-11-23 12:02:00,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {16702#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16703#(<= main_~a~0 21)} is VALID [2018-11-23 12:02:00,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {16703#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16703#(<= main_~a~0 21)} is VALID [2018-11-23 12:02:00,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {16703#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16704#(<= main_~a~0 22)} is VALID [2018-11-23 12:02:00,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {16704#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16704#(<= main_~a~0 22)} is VALID [2018-11-23 12:02:00,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {16704#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16705#(<= main_~a~0 23)} is VALID [2018-11-23 12:02:00,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {16705#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16705#(<= main_~a~0 23)} is VALID [2018-11-23 12:02:00,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {16705#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16706#(<= main_~a~0 24)} is VALID [2018-11-23 12:02:00,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {16706#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16706#(<= main_~a~0 24)} is VALID [2018-11-23 12:02:00,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {16706#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16707#(<= main_~a~0 25)} is VALID [2018-11-23 12:02:00,914 INFO L273 TraceCheckUtils]: 56: Hoare triple {16707#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16707#(<= main_~a~0 25)} is VALID [2018-11-23 12:02:00,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {16707#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16708#(<= main_~a~0 26)} is VALID [2018-11-23 12:02:00,915 INFO L273 TraceCheckUtils]: 58: Hoare triple {16708#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16708#(<= main_~a~0 26)} is VALID [2018-11-23 12:02:00,916 INFO L273 TraceCheckUtils]: 59: Hoare triple {16708#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16709#(<= main_~a~0 27)} is VALID [2018-11-23 12:02:00,916 INFO L273 TraceCheckUtils]: 60: Hoare triple {16709#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16709#(<= main_~a~0 27)} is VALID [2018-11-23 12:02:00,917 INFO L273 TraceCheckUtils]: 61: Hoare triple {16709#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16710#(<= main_~a~0 28)} is VALID [2018-11-23 12:02:00,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {16710#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16710#(<= main_~a~0 28)} is VALID [2018-11-23 12:02:00,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {16710#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16711#(<= main_~a~0 29)} is VALID [2018-11-23 12:02:00,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {16711#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16711#(<= main_~a~0 29)} is VALID [2018-11-23 12:02:00,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {16711#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16712#(<= main_~a~0 30)} is VALID [2018-11-23 12:02:00,920 INFO L273 TraceCheckUtils]: 66: Hoare triple {16712#(<= main_~a~0 30)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16712#(<= main_~a~0 30)} is VALID [2018-11-23 12:02:00,921 INFO L273 TraceCheckUtils]: 67: Hoare triple {16712#(<= main_~a~0 30)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16713#(<= main_~a~0 31)} is VALID [2018-11-23 12:02:00,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {16713#(<= main_~a~0 31)} assume !(~a~0 < 100000); {16681#false} is VALID [2018-11-23 12:02:00,922 INFO L273 TraceCheckUtils]: 69: Hoare triple {16681#false} havoc ~i~0;~i~0 := 0; {16681#false} is VALID [2018-11-23 12:02:00,922 INFO L273 TraceCheckUtils]: 70: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,922 INFO L273 TraceCheckUtils]: 71: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,922 INFO L273 TraceCheckUtils]: 72: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,923 INFO L273 TraceCheckUtils]: 73: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,923 INFO L273 TraceCheckUtils]: 74: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,923 INFO L273 TraceCheckUtils]: 75: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,923 INFO L273 TraceCheckUtils]: 77: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 78: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 79: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 80: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 81: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 82: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,924 INFO L273 TraceCheckUtils]: 83: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 84: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 87: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 89: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 90: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 91: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,925 INFO L273 TraceCheckUtils]: 92: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 93: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {16681#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 95: Hoare triple {16681#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 96: Hoare triple {16681#false} assume !(~i~0 < 100000); {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 97: Hoare triple {16681#false} havoc ~x~0;~x~0 := 0; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 98: Hoare triple {16681#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L256 TraceCheckUtils]: 99: Hoare triple {16681#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {16681#false} ~cond := #in~cond; {16681#false} is VALID [2018-11-23 12:02:00,926 INFO L273 TraceCheckUtils]: 101: Hoare triple {16681#false} assume 0 == ~cond; {16681#false} is VALID [2018-11-23 12:02:00,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {16681#false} assume !false; {16681#false} is VALID [2018-11-23 12:02:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:02:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:02:00,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2018-11-23 12:02:00,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:00,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:02:01,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:01,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:02:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:02:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:02:01,046 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 35 states. [2018-11-23 12:02:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,443 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-23 12:02:01,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:02:01,443 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2018-11-23 12:02:01,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:02:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 104 transitions. [2018-11-23 12:02:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:02:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 104 transitions. [2018-11-23 12:02:01,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 104 transitions. [2018-11-23 12:02:01,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:01,591 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:02:01,591 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:02:01,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:02:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:02:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-23 12:02:01,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:01,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 110 states. [2018-11-23 12:02:01,655 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 110 states. [2018-11-23 12:02:01,655 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 110 states. [2018-11-23 12:02:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,658 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-23 12:02:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-23 12:02:01,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,658 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 111 states. [2018-11-23 12:02:01,658 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 111 states. [2018-11-23 12:02:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,660 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-23 12:02:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-23 12:02:01,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:01,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 12:02:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-23 12:02:01,662 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2018-11-23 12:02:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:01,663 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-23 12:02:01,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:02:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-23 12:02:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 12:02:01,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:01,664 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:01,664 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1461346004, now seen corresponding path program 30 times [2018-11-23 12:02:01,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:03,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {17630#true} call ULTIMATE.init(); {17630#true} is VALID [2018-11-23 12:02:03,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {17630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17630#true} is VALID [2018-11-23 12:02:03,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {17630#true} assume true; {17630#true} is VALID [2018-11-23 12:02:03,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17630#true} {17630#true} #63#return; {17630#true} is VALID [2018-11-23 12:02:03,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {17630#true} call #t~ret7 := main(); {17630#true} is VALID [2018-11-23 12:02:03,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {17630#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17632#(= main_~a~0 0)} is VALID [2018-11-23 12:02:03,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {17632#(= 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; {17632#(= main_~a~0 0)} is VALID [2018-11-23 12:02:03,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {17632#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:03,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {17633#(<= 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; {17633#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:03,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {17633#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:03,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {17634#(<= 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; {17634#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:03,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {17634#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:03,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {17635#(<= 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; {17635#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:03,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {17635#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:03,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {17636#(<= 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; {17636#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:03,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {17636#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:03,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {17637#(<= 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; {17637#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:03,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {17637#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:03,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {17638#(<= 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; {17638#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:03,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {17638#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17639#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:03,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {17639#(<= 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; {17639#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:03,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {17639#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17640#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:03,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {17640#(<= 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; {17640#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:03,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {17640#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17641#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:03,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {17641#(<= 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; {17641#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:03,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {17641#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17642#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:03,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {17642#(<= 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; {17642#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:03,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {17642#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17643#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:03,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {17643#(<= 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; {17643#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:03,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {17643#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17644#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:03,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {17644#(<= 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; {17644#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:03,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {17644#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17645#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:03,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {17645#(<= 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; {17645#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:03,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {17645#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17646#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:03,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {17646#(<= 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; {17646#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:03,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {17646#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17647#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:03,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {17647#(<= 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; {17647#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:03,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {17647#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17648#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:03,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {17648#(<= 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; {17648#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:03,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {17648#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17649#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:03,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {17649#(<= 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; {17649#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:03,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {17649#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17650#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:03,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {17650#(<= 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; {17650#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:03,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {17650#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17651#(<= main_~a~0 19)} is VALID [2018-11-23 12:02:03,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {17651#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17651#(<= main_~a~0 19)} is VALID [2018-11-23 12:02:03,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {17651#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17652#(<= main_~a~0 20)} is VALID [2018-11-23 12:02:03,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {17652#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17652#(<= main_~a~0 20)} is VALID [2018-11-23 12:02:03,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {17652#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17653#(<= main_~a~0 21)} is VALID [2018-11-23 12:02:03,460 INFO L273 TraceCheckUtils]: 48: Hoare triple {17653#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17653#(<= main_~a~0 21)} is VALID [2018-11-23 12:02:03,461 INFO L273 TraceCheckUtils]: 49: Hoare triple {17653#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17654#(<= main_~a~0 22)} is VALID [2018-11-23 12:02:03,461 INFO L273 TraceCheckUtils]: 50: Hoare triple {17654#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17654#(<= main_~a~0 22)} is VALID [2018-11-23 12:02:03,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {17654#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17655#(<= main_~a~0 23)} is VALID [2018-11-23 12:02:03,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {17655#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17655#(<= main_~a~0 23)} is VALID [2018-11-23 12:02:03,463 INFO L273 TraceCheckUtils]: 53: Hoare triple {17655#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17656#(<= main_~a~0 24)} is VALID [2018-11-23 12:02:03,464 INFO L273 TraceCheckUtils]: 54: Hoare triple {17656#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17656#(<= main_~a~0 24)} is VALID [2018-11-23 12:02:03,464 INFO L273 TraceCheckUtils]: 55: Hoare triple {17656#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17657#(<= main_~a~0 25)} is VALID [2018-11-23 12:02:03,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {17657#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17657#(<= main_~a~0 25)} is VALID [2018-11-23 12:02:03,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {17657#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17658#(<= main_~a~0 26)} is VALID [2018-11-23 12:02:03,466 INFO L273 TraceCheckUtils]: 58: Hoare triple {17658#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17658#(<= main_~a~0 26)} is VALID [2018-11-23 12:02:03,467 INFO L273 TraceCheckUtils]: 59: Hoare triple {17658#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17659#(<= main_~a~0 27)} is VALID [2018-11-23 12:02:03,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {17659#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17659#(<= main_~a~0 27)} is VALID [2018-11-23 12:02:03,468 INFO L273 TraceCheckUtils]: 61: Hoare triple {17659#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17660#(<= main_~a~0 28)} is VALID [2018-11-23 12:02:03,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {17660#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17660#(<= main_~a~0 28)} is VALID [2018-11-23 12:02:03,469 INFO L273 TraceCheckUtils]: 63: Hoare triple {17660#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17661#(<= main_~a~0 29)} is VALID [2018-11-23 12:02:03,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {17661#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17661#(<= main_~a~0 29)} is VALID [2018-11-23 12:02:03,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {17661#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17662#(<= main_~a~0 30)} is VALID [2018-11-23 12:02:03,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {17662#(<= main_~a~0 30)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17662#(<= main_~a~0 30)} is VALID [2018-11-23 12:02:03,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {17662#(<= main_~a~0 30)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17663#(<= main_~a~0 31)} is VALID [2018-11-23 12:02:03,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {17663#(<= main_~a~0 31)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {17663#(<= main_~a~0 31)} is VALID [2018-11-23 12:02:03,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {17663#(<= main_~a~0 31)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17664#(<= main_~a~0 32)} is VALID [2018-11-23 12:02:03,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {17664#(<= main_~a~0 32)} assume !(~a~0 < 100000); {17631#false} is VALID [2018-11-23 12:02:03,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#false} havoc ~i~0;~i~0 := 0; {17631#false} is VALID [2018-11-23 12:02:03,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,475 INFO L273 TraceCheckUtils]: 75: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,475 INFO L273 TraceCheckUtils]: 76: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,475 INFO L273 TraceCheckUtils]: 77: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 81: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 82: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,477 INFO L273 TraceCheckUtils]: 84: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,477 INFO L273 TraceCheckUtils]: 85: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,477 INFO L273 TraceCheckUtils]: 86: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,477 INFO L273 TraceCheckUtils]: 88: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 92: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 96: Hoare triple {17631#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {17631#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 98: Hoare triple {17631#false} assume !(~i~0 < 100000); {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {17631#false} havoc ~x~0;~x~0 := 0; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 100: Hoare triple {17631#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L256 TraceCheckUtils]: 101: Hoare triple {17631#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 102: Hoare triple {17631#false} ~cond := #in~cond; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {17631#false} assume 0 == ~cond; {17631#false} is VALID [2018-11-23 12:02:03,479 INFO L273 TraceCheckUtils]: 104: Hoare triple {17631#false} assume !false; {17631#false} is VALID [2018-11-23 12:02:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 12:02:03,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:03,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:03,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE