java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:57:40,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:57:40,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:57:40,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:57:40,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:57:40,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:57:40,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:57:40,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:57:40,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:57:40,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:57:40,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:57:40,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:57:40,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:57:40,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:57:40,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:57:40,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:57:40,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:57:40,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:57:40,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:57:40,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:57:40,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:57:40,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:57:40,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:57:40,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:57:40,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:57:40,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:57:40,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:57:40,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:57:40,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:57:40,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:57:40,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:57:40,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:57:40,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:57:40,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:57:40,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:57:40,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:57:40,430 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:57:40,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:57:40,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:57:40,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:57:40,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:57:40,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:57:40,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:57:40,463 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:57:40,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:57:40,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:57:40,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:57:40,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:57:40,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:57:40,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:57:40,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:57:40,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:57:40,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:57:40,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:57:40,466 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:57:40,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:57:40,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:57:40,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:57:40,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:57:40,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:57:40,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:57:40,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:57:40,469 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:57:40,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:57:40,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:57:40,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:57:40,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:57:40,470 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:57:40,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:57:40,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:57:40,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:57:40,552 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:57:40,553 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:57:40,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_true-unreach-call.i [2018-11-18 22:57:40,622 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537d6034d/0e17954eb69342c2b2516b8f63b9ad53/FLAGac265c0b4 [2018-11-18 22:57:41,053 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:57:41,054 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_original_true-unreach-call.i [2018-11-18 22:57:41,060 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537d6034d/0e17954eb69342c2b2516b8f63b9ad53/FLAGac265c0b4 [2018-11-18 22:57:41,404 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537d6034d/0e17954eb69342c2b2516b8f63b9ad53 [2018-11-18 22:57:41,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:57:41,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:57:41,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:57:41,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:57:41,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:57:41,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a4398c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41, skipping insertion in model container [2018-11-18 22:57:41,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:57:41,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:57:41,710 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:57:41,716 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:57:41,754 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:57:41,780 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:57:41,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41 WrapperNode [2018-11-18 22:57:41,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:57:41,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:57:41,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:57:41,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:57:41,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... [2018-11-18 22:57:41,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:57:41,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:57:41,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:57:41,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:57:41,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:57:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:57:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:57:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:57:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:57:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:57:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:57:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:57:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:57:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:57:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:57:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:57:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:57:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:57:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:57:41,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:57:42,575 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:57:42,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:42 BoogieIcfgContainer [2018-11-18 22:57:42,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:57:42,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:57:42,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:57:42,580 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:57:42,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:57:41" (1/3) ... [2018-11-18 22:57:42,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0d5705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:42, skipping insertion in model container [2018-11-18 22:57:42,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:41" (2/3) ... [2018-11-18 22:57:42,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0d5705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:42, skipping insertion in model container [2018-11-18 22:57:42,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:42" (3/3) ... [2018-11-18 22:57:42,583 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_true-unreach-call.i [2018-11-18 22:57:42,592 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:57:42,600 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:57:42,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:57:42,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:57:42,649 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:57:42,649 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:57:42,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:57:42,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:57:42,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:57:42,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:57:42,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:57:42,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:57:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 22:57:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 22:57:42,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:42,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:42,683 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:42,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1238920532, now seen corresponding path program 1 times [2018-11-18 22:57:42,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:42,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-18 22:57:42,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-18 22:57:42,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 22:57:42,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #75#return; {33#true} is VALID [2018-11-18 22:57:42,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret8 := main(); {33#true} is VALID [2018-11-18 22:57:42,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {33#true} is VALID [2018-11-18 22:57:42,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-18 22:57:42,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-18 22:57:42,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-18 22:57:42,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-18 22:57:42,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} #t~short5 := ~i~0 < 100000; {34#false} is VALID [2018-11-18 22:57:42,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !#t~short5; {34#false} is VALID [2018-11-18 22:57:42,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {34#false} is VALID [2018-11-18 22:57:42,851 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {34#false} is VALID [2018-11-18 22:57:42,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-18 22:57:42,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-18 22:57:42,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-18 22:57:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:42,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:57:42,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:57:42,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 22:57:42,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:42,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:57:43,053 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-18 22:57:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:57:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:57:43,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:57:43,068 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 22:57:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:43,334 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-18 22:57:43,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:57:43,334 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 22:57:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:57:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-18 22:57:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:57:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-18 22:57:43,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-18 22:57:43,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:43,581 INFO L225 Difference]: With dead ends: 52 [2018-11-18 22:57:43,581 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 22:57:43,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:57:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 22:57:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 22:57:43,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:43,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-18 22:57:43,690 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 22:57:43,690 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 22:57:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:43,695 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-18 22:57:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 22:57:43,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:43,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:43,696 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 22:57:43,696 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 22:57:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:43,701 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-18 22:57:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 22:57:43,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:43,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:43,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:43,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:57:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 22:57:43,707 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2018-11-18 22:57:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:43,707 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 22:57:43,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:57:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 22:57:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:57:43,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:43,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:43,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:43,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -268948453, now seen corresponding path program 1 times [2018-11-18 22:57:43,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:43,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:43,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-18 22:57:43,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {183#true} is VALID [2018-11-18 22:57:43,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-18 22:57:43,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #75#return; {183#true} is VALID [2018-11-18 22:57:43,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret8 := main(); {183#true} is VALID [2018-11-18 22:57:43,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {185#(= main_~j~0 0)} is VALID [2018-11-18 22:57:43,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {185#(= main_~j~0 0)} assume true; {185#(= main_~j~0 0)} is VALID [2018-11-18 22:57:43,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#(= main_~j~0 0)} assume !(~j~0 < 100000); {184#false} is VALID [2018-11-18 22:57:43,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#false} assume true; {184#false} is VALID [2018-11-18 22:57:43,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {184#false} #t~short2 := ~i~0 < 100000; {184#false} is VALID [2018-11-18 22:57:43,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {184#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {184#false} is VALID [2018-11-18 22:57:43,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {184#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {184#false} is VALID [2018-11-18 22:57:43,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} ~i~0 := 0; {184#false} is VALID [2018-11-18 22:57:43,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {184#false} assume true; {184#false} is VALID [2018-11-18 22:57:43,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {184#false} #t~short5 := ~i~0 < 100000; {184#false} is VALID [2018-11-18 22:57:43,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {184#false} assume !#t~short5; {184#false} is VALID [2018-11-18 22:57:43,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {184#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {184#false} is VALID [2018-11-18 22:57:43,817 INFO L256 TraceCheckUtils]: 17: Hoare triple {184#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {184#false} is VALID [2018-11-18 22:57:43,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2018-11-18 22:57:43,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2018-11-18 22:57:43,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-18 22:57:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:43,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:57:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:57:43,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:57:43,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:43,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:57:43,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:43,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:57:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:57:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:57:43,889 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-18 22:57:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,064 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 22:57:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:57:44,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:57:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:57:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-18 22:57:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:57:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-18 22:57:44,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2018-11-18 22:57:44,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:44,448 INFO L225 Difference]: With dead ends: 44 [2018-11-18 22:57:44,448 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 22:57:44,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:57:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 22:57:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 22:57:44,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:44,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,464 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,464 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,468 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-18 22:57:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 22:57:44,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,470 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,470 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,473 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-18 22:57:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 22:57:44,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:44,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:57:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-18 22:57:44,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2018-11-18 22:57:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:44,478 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 22:57:44,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:57:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 22:57:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:57:44,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:44,479 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:44,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:44,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1356495029, now seen corresponding path program 1 times [2018-11-18 22:57:44,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:44,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-18 22:57:44,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {334#true} is VALID [2018-11-18 22:57:44,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-18 22:57:44,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #75#return; {334#true} is VALID [2018-11-18 22:57:44,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2018-11-18 22:57:44,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {334#true} is VALID [2018-11-18 22:57:44,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-18 22:57:44,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {334#true} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {334#true} is VALID [2018-11-18 22:57:44,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-18 22:57:44,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {334#true} assume !(~j~0 < 100000); {334#true} is VALID [2018-11-18 22:57:44,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-18 22:57:44,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#true} #t~short2 := ~i~0 < 100000; {334#true} is VALID [2018-11-18 22:57:44,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {334#true} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {334#true} is VALID [2018-11-18 22:57:44,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#true} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {334#true} is VALID [2018-11-18 22:57:44,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {334#true} ~i~0 := 0; {334#true} is VALID [2018-11-18 22:57:44,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-18 22:57:44,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {334#true} #t~short5 := ~i~0 < 100000; {334#true} is VALID [2018-11-18 22:57:44,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {334#true} assume !#t~short5; {336#(not |main_#t~short5|)} is VALID [2018-11-18 22:57:44,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {336#(not |main_#t~short5|)} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2018-11-18 22:57:44,605 INFO L256 TraceCheckUtils]: 19: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {335#false} is VALID [2018-11-18 22:57:44,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2018-11-18 22:57:44,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2018-11-18 22:57:44,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-18 22:57:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:57:44,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:57:44,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:57:44,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 22:57:44,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:44,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:57:44,643 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-18 22:57:44,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:57:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:57:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:57:44,644 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-18 22:57:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,871 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-18 22:57:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:57:44,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 22:57:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:57:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-18 22:57:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:57:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-18 22:57:44,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-18 22:57:44,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:44,955 INFO L225 Difference]: With dead ends: 40 [2018-11-18 22:57:44,956 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 22:57:44,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:57:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 22:57:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 22:57:44,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:44,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,970 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,970 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,974 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 22:57:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 22:57:44,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,975 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,975 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 22:57:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,977 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 22:57:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 22:57:44,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:44,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:57:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 22:57:44,981 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2018-11-18 22:57:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:44,982 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 22:57:44,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:57:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 22:57:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:57:44,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:44,983 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:44,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:44,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1299236727, now seen corresponding path program 1 times [2018-11-18 22:57:44,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:44,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:44,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:44,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:44,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:45,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-18 22:57:45,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-18 22:57:45,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-18 22:57:45,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #75#return; {481#true} is VALID [2018-11-18 22:57:45,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret8 := main(); {481#true} is VALID [2018-11-18 22:57:45,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {483#(= main_~j~0 0)} is VALID [2018-11-18 22:57:45,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= main_~j~0 0)} assume true; {483#(= main_~j~0 0)} is VALID [2018-11-18 22:57:45,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {484#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:45,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume true; {484#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:45,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} assume !(~j~0 < 100000); {482#false} is VALID [2018-11-18 22:57:45,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-18 22:57:45,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} #t~short2 := ~i~0 < 100000; {482#false} is VALID [2018-11-18 22:57:45,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {482#false} is VALID [2018-11-18 22:57:45,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {482#false} is VALID [2018-11-18 22:57:45,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} ~i~0 := 0; {482#false} is VALID [2018-11-18 22:57:45,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-18 22:57:45,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#false} #t~short5 := ~i~0 < 100000; {482#false} is VALID [2018-11-18 22:57:45,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {482#false} is VALID [2018-11-18 22:57:45,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {482#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {482#false} is VALID [2018-11-18 22:57:45,083 INFO L256 TraceCheckUtils]: 19: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {482#false} is VALID [2018-11-18 22:57:45,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2018-11-18 22:57:45,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2018-11-18 22:57:45,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-18 22:57:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:45,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:45,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:45,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:45,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:45,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-18 22:57:45,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-18 22:57:45,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-18 22:57:45,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #75#return; {481#true} is VALID [2018-11-18 22:57:45,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret8 := main(); {481#true} is VALID [2018-11-18 22:57:45,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {503#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:45,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(<= main_~j~0 0)} assume true; {503#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:45,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {484#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:45,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume true; {484#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:45,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} assume !(~j~0 < 100000); {482#false} is VALID [2018-11-18 22:57:45,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-18 22:57:45,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} #t~short2 := ~i~0 < 100000; {482#false} is VALID [2018-11-18 22:57:45,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {482#false} is VALID [2018-11-18 22:57:45,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {482#false} is VALID [2018-11-18 22:57:45,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} ~i~0 := 0; {482#false} is VALID [2018-11-18 22:57:45,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-18 22:57:45,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#false} #t~short5 := ~i~0 < 100000; {482#false} is VALID [2018-11-18 22:57:45,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {482#false} is VALID [2018-11-18 22:57:45,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {482#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {482#false} is VALID [2018-11-18 22:57:45,723 INFO L256 TraceCheckUtils]: 19: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {482#false} is VALID [2018-11-18 22:57:45,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2018-11-18 22:57:45,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2018-11-18 22:57:45,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-18 22:57:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:45,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:45,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:57:45,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-18 22:57:45,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:45,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:57:45,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:45,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:57:45,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:57:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:57:45,802 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2018-11-18 22:57:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,078 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-18 22:57:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:57:46,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-18 22:57:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:57:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-18 22:57:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:57:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-18 22:57:46,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-18 22:57:46,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:46,203 INFO L225 Difference]: With dead ends: 46 [2018-11-18 22:57:46,203 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 22:57:46,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:57:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 22:57:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 22:57:46,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:46,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-18 22:57:46,261 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:57:46,261 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:57:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,263 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 22:57:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:57:46,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:46,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:46,264 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 22:57:46,264 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 22:57:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:46,267 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 22:57:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:57:46,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:46,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:46,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:46,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 22:57:46,271 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2018-11-18 22:57:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:46,272 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 22:57:46,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:57:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:57:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:57:46,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:46,273 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:46,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:46,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash -17672815, now seen corresponding path program 2 times [2018-11-18 22:57:46,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:46,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:46,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-18 22:57:46,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-18 22:57:46,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-18 22:57:46,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #75#return; {710#true} is VALID [2018-11-18 22:57:46,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret8 := main(); {710#true} is VALID [2018-11-18 22:57:46,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {712#(= main_~j~0 0)} is VALID [2018-11-18 22:57:46,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#(= main_~j~0 0)} assume true; {712#(= main_~j~0 0)} is VALID [2018-11-18 22:57:46,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {713#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:46,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(<= main_~j~0 1)} assume true; {713#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:46,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {714#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:46,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {714#(<= main_~j~0 2)} assume true; {714#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:46,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {714#(<= main_~j~0 2)} assume !(~j~0 < 100000); {711#false} is VALID [2018-11-18 22:57:46,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#false} assume true; {711#false} is VALID [2018-11-18 22:57:46,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} #t~short2 := ~i~0 < 100000; {711#false} is VALID [2018-11-18 22:57:46,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {711#false} is VALID [2018-11-18 22:57:46,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {711#false} is VALID [2018-11-18 22:57:46,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-18 22:57:46,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} assume true; {711#false} is VALID [2018-11-18 22:57:46,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#false} #t~short5 := ~i~0 < 100000; {711#false} is VALID [2018-11-18 22:57:46,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {711#false} is VALID [2018-11-18 22:57:46,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {711#false} is VALID [2018-11-18 22:57:46,385 INFO L256 TraceCheckUtils]: 21: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {711#false} is VALID [2018-11-18 22:57:46,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-18 22:57:46,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-18 22:57:46,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-18 22:57:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:46,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:46,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:46,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:46,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:57:46,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:46,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:46,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-18 22:57:46,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-18 22:57:46,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-18 22:57:46,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #75#return; {710#true} is VALID [2018-11-18 22:57:46,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret8 := main(); {710#true} is VALID [2018-11-18 22:57:46,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {733#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {761#(and (= 0 |main_~#src~0.offset|) (or (and (not |main_#t~short2|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|))) (and (not (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|))) |main_#t~short2|)))} is VALID [2018-11-18 22:57:46,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#(and (= 0 |main_~#src~0.offset|) (or (and (not |main_#t~short2|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|))) (and (not (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|))) |main_#t~short2|)))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {765#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)))} is VALID [2018-11-18 22:57:46,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {765#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)))} ~i~0 := 0; {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} assume true; {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-18 22:57:46,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {769#(and (= 0 |main_~#src~0.offset|) (= 0 (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {779#(not |main_#t~short5|)} is VALID [2018-11-18 22:57:46,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {779#(not |main_#t~short5|)} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {711#false} is VALID [2018-11-18 22:57:46,741 INFO L256 TraceCheckUtils]: 21: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {711#false} is VALID [2018-11-18 22:57:46,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-18 22:57:46,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-18 22:57:46,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-18 22:57:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 22:57:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:57:46,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-18 22:57:46,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-18 22:57:46,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:46,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:57:46,840 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-18 22:57:46,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:57:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:57:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:57:46,841 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 10 states. [2018-11-18 22:57:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,603 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-18 22:57:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:57:47,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-18 22:57:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:57:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-18 22:57:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:57:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-18 22:57:47,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2018-11-18 22:57:47,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:47,737 INFO L225 Difference]: With dead ends: 65 [2018-11-18 22:57:47,738 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 22:57:47,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:57:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 22:57:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-18 22:57:47,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:47,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 35 states. [2018-11-18 22:57:47,760 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 35 states. [2018-11-18 22:57:47,760 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 35 states. [2018-11-18 22:57:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,764 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 22:57:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 22:57:47,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:47,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:47,765 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 43 states. [2018-11-18 22:57:47,765 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 43 states. [2018-11-18 22:57:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,769 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 22:57:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 22:57:47,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:47,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:47,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:47,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:57:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-18 22:57:47,777 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2018-11-18 22:57:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:47,777 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-18 22:57:47,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:57:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 22:57:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:57:47,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:47,779 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:47,780 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:47,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2146293075, now seen corresponding path program 1 times [2018-11-18 22:57:47,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:47,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:47,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:47,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2018-11-18 22:57:47,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {1018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1018#true} is VALID [2018-11-18 22:57:47,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-18 22:57:47,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #75#return; {1018#true} is VALID [2018-11-18 22:57:47,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2018-11-18 22:57:47,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {1018#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {1020#(= main_~i~0 0)} assume true; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {1020#(= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {1020#(= main_~i~0 0)} assume true; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {1020#(= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {1020#(= main_~i~0 0)} assume true; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {1020#(= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {1020#(= main_~i~0 0)} assume true; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {1020#(= main_~i~0 0)} assume !(~j~0 < 100000); {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {1020#(= main_~i~0 0)} assume true; {1020#(= main_~i~0 0)} is VALID [2018-11-18 22:57:47,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {1020#(= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {1021#|main_#t~short2|} is VALID [2018-11-18 22:57:47,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {1021#|main_#t~short2|} assume !#t~short2; {1019#false} is VALID [2018-11-18 22:57:47,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {1019#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1019#false} is VALID [2018-11-18 22:57:47,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#false} ~i~0 := 0; {1019#false} is VALID [2018-11-18 22:57:47,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {1019#false} assume true; {1019#false} is VALID [2018-11-18 22:57:47,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {1019#false} #t~short5 := ~i~0 < 100000; {1019#false} is VALID [2018-11-18 22:57:47,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {1019#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1019#false} is VALID [2018-11-18 22:57:47,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {1019#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1019#false} is VALID [2018-11-18 22:57:47,913 INFO L256 TraceCheckUtils]: 23: Hoare triple {1019#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1019#false} is VALID [2018-11-18 22:57:47,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {1019#false} ~cond := #in~cond; {1019#false} is VALID [2018-11-18 22:57:47,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {1019#false} assume 0 == ~cond; {1019#false} is VALID [2018-11-18 22:57:47,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2018-11-18 22:57:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 22:57:47,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:57:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:57:47,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 22:57:47,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:47,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:57:47,954 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-18 22:57:47,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:57:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:57:47,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:57:47,955 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-11-18 22:57:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:48,124 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-18 22:57:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:57:48,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 22:57:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:57:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-18 22:57:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:57:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-18 22:57:48,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-18 22:57:48,222 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-18 22:57:48,224 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:57:48,225 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 22:57:48,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:57:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 22:57:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-11-18 22:57:48,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:48,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 35 states. [2018-11-18 22:57:48,269 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 35 states. [2018-11-18 22:57:48,269 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 35 states. [2018-11-18 22:57:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:48,272 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-18 22:57:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 22:57:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:48,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:48,273 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 41 states. [2018-11-18 22:57:48,273 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 41 states. [2018-11-18 22:57:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:48,276 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-18 22:57:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 22:57:48,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:48,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:48,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:48,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:57:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 22:57:48,280 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2018-11-18 22:57:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:48,280 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 22:57:48,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:57:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 22:57:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:57:48,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:48,281 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:48,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:48,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -588778495, now seen corresponding path program 1 times [2018-11-18 22:57:48,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:48,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {1228#true} call ULTIMATE.init(); {1228#true} is VALID [2018-11-18 22:57:48,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {1228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1228#true} is VALID [2018-11-18 22:57:48,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {1228#true} assume true; {1228#true} is VALID [2018-11-18 22:57:48,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1228#true} {1228#true} #75#return; {1228#true} is VALID [2018-11-18 22:57:48,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {1228#true} call #t~ret8 := main(); {1228#true} is VALID [2018-11-18 22:57:48,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1228#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1230#(= main_~j~0 0)} is VALID [2018-11-18 22:57:48,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {1230#(= main_~j~0 0)} assume true; {1230#(= main_~j~0 0)} is VALID [2018-11-18 22:57:48,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {1230#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1231#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:48,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {1231#(<= main_~j~0 1)} assume true; {1231#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:48,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {1231#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1232#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:48,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {1232#(<= main_~j~0 2)} assume true; {1232#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:48,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {1232#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1233#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:48,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {1233#(<= main_~j~0 3)} assume true; {1233#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:48,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {1233#(<= main_~j~0 3)} assume !(~j~0 < 100000); {1229#false} is VALID [2018-11-18 22:57:48,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {1229#false} #t~short2 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {1229#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1229#false} is VALID [2018-11-18 22:57:48,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {1229#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1229#false} is VALID [2018-11-18 22:57:48,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#false} #t~short2 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1229#false} is VALID [2018-11-18 22:57:48,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1229#false} is VALID [2018-11-18 22:57:48,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {1229#false} ~i~0 := 0; {1229#false} is VALID [2018-11-18 22:57:48,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {1229#false} #t~short5 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,438 INFO L273 TraceCheckUtils]: 25: Hoare triple {1229#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1229#false} is VALID [2018-11-18 22:57:48,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {1229#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1229#false} is VALID [2018-11-18 22:57:48,438 INFO L256 TraceCheckUtils]: 27: Hoare triple {1229#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1229#false} is VALID [2018-11-18 22:57:48,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {1229#false} ~cond := #in~cond; {1229#false} is VALID [2018-11-18 22:57:48,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {1229#false} assume 0 == ~cond; {1229#false} is VALID [2018-11-18 22:57:48,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {1229#false} assume !false; {1229#false} is VALID [2018-11-18 22:57:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:57:48,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:48,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:48,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:48,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {1228#true} call ULTIMATE.init(); {1228#true} is VALID [2018-11-18 22:57:48,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {1228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1228#true} is VALID [2018-11-18 22:57:48,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {1228#true} assume true; {1228#true} is VALID [2018-11-18 22:57:48,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1228#true} {1228#true} #75#return; {1228#true} is VALID [2018-11-18 22:57:48,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {1228#true} call #t~ret8 := main(); {1228#true} is VALID [2018-11-18 22:57:48,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {1228#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1252#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:48,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {1252#(<= main_~j~0 0)} assume true; {1252#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:48,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {1252#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1231#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:48,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {1231#(<= main_~j~0 1)} assume true; {1231#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:48,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {1231#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1232#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:48,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {1232#(<= main_~j~0 2)} assume true; {1232#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:48,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {1232#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1233#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:48,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {1233#(<= main_~j~0 3)} assume true; {1233#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:48,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1233#(<= main_~j~0 3)} assume !(~j~0 < 100000); {1229#false} is VALID [2018-11-18 22:57:48,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {1229#false} #t~short2 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {1229#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1229#false} is VALID [2018-11-18 22:57:48,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1229#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1229#false} is VALID [2018-11-18 22:57:48,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#false} #t~short2 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1229#false} is VALID [2018-11-18 22:57:48,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1229#false} is VALID [2018-11-18 22:57:48,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {1229#false} ~i~0 := 0; {1229#false} is VALID [2018-11-18 22:57:48,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {1229#false} assume true; {1229#false} is VALID [2018-11-18 22:57:48,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {1229#false} #t~short5 := ~i~0 < 100000; {1229#false} is VALID [2018-11-18 22:57:48,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {1229#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1229#false} is VALID [2018-11-18 22:57:48,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {1229#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1229#false} is VALID [2018-11-18 22:57:48,640 INFO L256 TraceCheckUtils]: 27: Hoare triple {1229#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1229#false} is VALID [2018-11-18 22:57:48,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {1229#false} ~cond := #in~cond; {1229#false} is VALID [2018-11-18 22:57:48,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {1229#false} assume 0 == ~cond; {1229#false} is VALID [2018-11-18 22:57:48,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {1229#false} assume !false; {1229#false} is VALID [2018-11-18 22:57:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:57:48,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:57:48,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-18 22:57:48,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:48,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:57:48,710 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-18 22:57:48,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:57:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:57:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:57:48,712 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 7 states. [2018-11-18 22:57:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:48,850 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-18 22:57:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:57:48,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-18 22:57:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:57:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-18 22:57:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:57:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-18 22:57:48,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-18 22:57:49,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:49,015 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:57:49,016 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 22:57:49,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:57:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 22:57:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 22:57:49,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:49,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 22:57:49,036 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 22:57:49,037 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 22:57:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,038 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 22:57:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 22:57:49,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:49,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:49,039 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 22:57:49,040 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 22:57:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,042 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 22:57:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 22:57:49,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:49,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:49,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:49,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:57:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-18 22:57:49,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 31 [2018-11-18 22:57:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:49,045 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-18 22:57:49,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:57:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 22:57:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:57:49,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:49,046 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:49,046 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:49,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2115057637, now seen corresponding path program 2 times [2018-11-18 22:57:49,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:49,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-18 22:57:49,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1523#true} is VALID [2018-11-18 22:57:49,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-18 22:57:49,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #75#return; {1523#true} is VALID [2018-11-18 22:57:49,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret8 := main(); {1523#true} is VALID [2018-11-18 22:57:49,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {1523#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1525#(= main_~j~0 0)} is VALID [2018-11-18 22:57:49,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {1525#(= main_~j~0 0)} assume true; {1525#(= main_~j~0 0)} is VALID [2018-11-18 22:57:49,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {1525#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1526#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:49,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {1526#(<= main_~j~0 1)} assume true; {1526#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:49,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {1526#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1527#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:49,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1527#(<= main_~j~0 2)} assume true; {1527#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:49,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {1527#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1528#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:49,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {1528#(<= main_~j~0 3)} assume true; {1528#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:49,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1528#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1529#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:49,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {1529#(<= main_~j~0 4)} assume true; {1529#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:49,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {1529#(<= main_~j~0 4)} assume !(~j~0 < 100000); {1524#false} is VALID [2018-11-18 22:57:49,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {1524#false} #t~short2 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {1524#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1524#false} is VALID [2018-11-18 22:57:49,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {1524#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1524#false} is VALID [2018-11-18 22:57:49,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {1524#false} #t~short2 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {1524#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1524#false} is VALID [2018-11-18 22:57:49,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {1524#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1524#false} is VALID [2018-11-18 22:57:49,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#false} ~i~0 := 0; {1524#false} is VALID [2018-11-18 22:57:49,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#false} #t~short5 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {1524#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1524#false} is VALID [2018-11-18 22:57:49,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {1524#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1524#false} is VALID [2018-11-18 22:57:49,265 INFO L256 TraceCheckUtils]: 29: Hoare triple {1524#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1524#false} is VALID [2018-11-18 22:57:49,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {1524#false} ~cond := #in~cond; {1524#false} is VALID [2018-11-18 22:57:49,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {1524#false} assume 0 == ~cond; {1524#false} is VALID [2018-11-18 22:57:49,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-18 22:57:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:57:49,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:49,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:49,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:49,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:49,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:49,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-18 22:57:49,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1523#true} is VALID [2018-11-18 22:57:49,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-18 22:57:49,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #75#return; {1523#true} is VALID [2018-11-18 22:57:49,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret8 := main(); {1523#true} is VALID [2018-11-18 22:57:49,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {1523#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1548#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:49,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {1548#(<= main_~j~0 0)} assume true; {1548#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:49,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {1548#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1526#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:49,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1526#(<= main_~j~0 1)} assume true; {1526#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:49,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {1526#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1527#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:49,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {1527#(<= main_~j~0 2)} assume true; {1527#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:49,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {1527#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1528#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:49,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {1528#(<= main_~j~0 3)} assume true; {1528#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:49,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {1528#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1529#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:49,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {1529#(<= main_~j~0 4)} assume true; {1529#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:49,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {1529#(<= main_~j~0 4)} assume !(~j~0 < 100000); {1524#false} is VALID [2018-11-18 22:57:49,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {1524#false} #t~short2 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {1524#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1524#false} is VALID [2018-11-18 22:57:49,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {1524#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1524#false} is VALID [2018-11-18 22:57:49,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {1524#false} #t~short2 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {1524#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1524#false} is VALID [2018-11-18 22:57:49,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {1524#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1524#false} is VALID [2018-11-18 22:57:49,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#false} ~i~0 := 0; {1524#false} is VALID [2018-11-18 22:57:49,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 22:57:49,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#false} #t~short5 := ~i~0 < 100000; {1524#false} is VALID [2018-11-18 22:57:49,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {1524#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1524#false} is VALID [2018-11-18 22:57:49,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {1524#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1524#false} is VALID [2018-11-18 22:57:49,685 INFO L256 TraceCheckUtils]: 29: Hoare triple {1524#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1524#false} is VALID [2018-11-18 22:57:49,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {1524#false} ~cond := #in~cond; {1524#false} is VALID [2018-11-18 22:57:49,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {1524#false} assume 0 == ~cond; {1524#false} is VALID [2018-11-18 22:57:49,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-18 22:57:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:57:49,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:49,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:57:49,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-18 22:57:49,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:49,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:57:49,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:49,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:57:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:57:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:57:49,744 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 8 states. [2018-11-18 22:57:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:49,935 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-18 22:57:49,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:57:49,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-18 22:57:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:57:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-18 22:57:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:57:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-18 22:57:49,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-18 22:57:50,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:50,036 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:57:50,036 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:57:50,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:57:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:57:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 22:57:50,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:50,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-18 22:57:50,067 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:57:50,067 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:57:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:50,070 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 22:57:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 22:57:50,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:50,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:50,071 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:57:50,071 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:57:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:50,073 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-18 22:57:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 22:57:50,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:50,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:50,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:50,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:57:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-18 22:57:50,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 33 [2018-11-18 22:57:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:50,076 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-18 22:57:50,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:57:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 22:57:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:57:50,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:50,077 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:50,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 9502133, now seen corresponding path program 3 times [2018-11-18 22:57:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:50,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:50,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2018-11-18 22:57:50,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {1835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1835#true} is VALID [2018-11-18 22:57:50,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2018-11-18 22:57:50,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #75#return; {1835#true} is VALID [2018-11-18 22:57:50,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret8 := main(); {1835#true} is VALID [2018-11-18 22:57:50,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1835#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1837#(= main_~j~0 0)} is VALID [2018-11-18 22:57:50,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {1837#(= main_~j~0 0)} assume true; {1837#(= main_~j~0 0)} is VALID [2018-11-18 22:57:50,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {1837#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1838#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:50,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {1838#(<= main_~j~0 1)} assume true; {1838#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:50,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {1838#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1839#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:50,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {1839#(<= main_~j~0 2)} assume true; {1839#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:50,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {1839#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1840#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:50,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {1840#(<= main_~j~0 3)} assume true; {1840#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:50,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {1840#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1841#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:50,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {1841#(<= main_~j~0 4)} assume true; {1841#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:50,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {1841#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1842#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:50,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {1842#(<= main_~j~0 5)} assume true; {1842#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:50,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {1842#(<= main_~j~0 5)} assume !(~j~0 < 100000); {1836#false} is VALID [2018-11-18 22:57:50,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {1836#false} assume true; {1836#false} is VALID [2018-11-18 22:57:50,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {1836#false} #t~short2 := ~i~0 < 100000; {1836#false} is VALID [2018-11-18 22:57:50,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {1836#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1836#false} is VALID [2018-11-18 22:57:50,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {1836#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1836#false} is VALID [2018-11-18 22:57:50,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {1836#false} assume true; {1836#false} is VALID [2018-11-18 22:57:50,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {1836#false} #t~short2 := ~i~0 < 100000; {1836#false} is VALID [2018-11-18 22:57:50,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {1836#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1836#false} is VALID [2018-11-18 22:57:50,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {1836#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1836#false} is VALID [2018-11-18 22:57:50,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {1836#false} ~i~0 := 0; {1836#false} is VALID [2018-11-18 22:57:50,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {1836#false} assume true; {1836#false} is VALID [2018-11-18 22:57:50,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {1836#false} #t~short5 := ~i~0 < 100000; {1836#false} is VALID [2018-11-18 22:57:50,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {1836#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1836#false} is VALID [2018-11-18 22:57:50,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {1836#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1836#false} is VALID [2018-11-18 22:57:50,286 INFO L256 TraceCheckUtils]: 31: Hoare triple {1836#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1836#false} is VALID [2018-11-18 22:57:50,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {1836#false} ~cond := #in~cond; {1836#false} is VALID [2018-11-18 22:57:50,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {1836#false} assume 0 == ~cond; {1836#false} is VALID [2018-11-18 22:57:50,287 INFO L273 TraceCheckUtils]: 34: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2018-11-18 22:57:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:57:50,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:50,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:50,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:50,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 22:57:50,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:50,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:50,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 22:57:50,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:57:50,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:57:50,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-18 22:57:50,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-18 22:57:50,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 22:57:50,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:57:50,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:57:50,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:57:50,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 22:57:50,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 22:57:50,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 22:57:50,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:57:51,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:57:51,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:57:51,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:57:51,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:57:51,078 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-18 22:57:51,080 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:57:51,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2018-11-18 22:57:51,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1835#true} is VALID [2018-11-18 22:57:51,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2018-11-18 22:57:51,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #75#return; {1835#true} is VALID [2018-11-18 22:57:51,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret8 := main(); {1835#true} is VALID [2018-11-18 22:57:51,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {1835#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {1861#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-18 22:57:51,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume true; {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-18 22:57:51,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-18 22:57:51,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-18 22:57:51,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-18 22:57:51,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {1910#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} ~i~0 := 0; {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume true; {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:51,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {1926#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#dst~0.base|) |main_~#dst~0.offset|) (select (select |#memory_int| |main_~#src~0.base|) |main_~#src~0.offset|)) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|) (= main_~i~0 0))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {1939#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-18 22:57:51,356 INFO L256 TraceCheckUtils]: 31: Hoare triple {1939#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1943#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 22:57:51,357 INFO L273 TraceCheckUtils]: 32: Hoare triple {1943#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1947#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:57:51,357 INFO L273 TraceCheckUtils]: 33: Hoare triple {1947#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1836#false} is VALID [2018-11-18 22:57:51,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2018-11-18 22:57:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:57:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 22:57:51,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-18 22:57:51,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:51,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:57:51,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:57:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:57:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:57:51,444 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 14 states. [2018-11-18 22:57:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:52,474 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-18 22:57:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:57:52,475 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-18 22:57:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:57:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2018-11-18 22:57:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:57:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2018-11-18 22:57:52,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 75 transitions. [2018-11-18 22:57:52,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:52,587 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:57:52,587 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:57:52,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:57:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:57:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-18 22:57:52,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:52,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-18 22:57:52,635 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-18 22:57:52,635 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-18 22:57:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:52,638 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-18 22:57:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-18 22:57:52,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:52,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:52,638 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-18 22:57:52,638 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-18 22:57:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:52,640 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-18 22:57:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-18 22:57:52,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:52,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:52,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:52,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:57:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-18 22:57:52,643 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 35 [2018-11-18 22:57:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:52,644 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-18 22:57:52,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:57:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 22:57:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:57:52,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:52,645 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:52,645 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:52,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash -126820906, now seen corresponding path program 1 times [2018-11-18 22:57:52,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:52,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:52,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:52,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:52,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:53,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2018-11-18 22:57:53,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {2230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2230#true} is VALID [2018-11-18 22:57:53,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2018-11-18 22:57:53,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #75#return; {2230#true} is VALID [2018-11-18 22:57:53,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret8 := main(); {2230#true} is VALID [2018-11-18 22:57:53,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {2230#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2232#(= main_~j~0 0)} is VALID [2018-11-18 22:57:53,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {2232#(= main_~j~0 0)} assume true; {2232#(= main_~j~0 0)} is VALID [2018-11-18 22:57:53,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {2232#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2233#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:53,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {2233#(<= main_~j~0 1)} assume true; {2233#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:53,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {2233#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2234#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:53,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {2234#(<= main_~j~0 2)} assume true; {2234#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:53,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {2234#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2235#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:53,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {2235#(<= main_~j~0 3)} assume true; {2235#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:53,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {2235#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2236#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:53,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {2236#(<= main_~j~0 4)} assume true; {2236#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:53,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {2236#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2237#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:53,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {2237#(<= main_~j~0 5)} assume true; {2237#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:53,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {2237#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2238#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:53,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {2238#(<= main_~j~0 6)} assume true; {2238#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {2238#(<= main_~j~0 6)} assume !(~j~0 < 100000); {2231#false} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {2231#false} #t~short2 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {2231#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2231#false} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {2231#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {2231#false} is VALID [2018-11-18 22:57:53,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {2231#false} #t~short2 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {2231#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {2231#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {2231#false} ~i~0 := 0; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {2231#false} #t~short5 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {2231#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2231#false} is VALID [2018-11-18 22:57:53,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {2231#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2231#false} is VALID [2018-11-18 22:57:53,193 INFO L256 TraceCheckUtils]: 33: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2230#true} is VALID [2018-11-18 22:57:53,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {2230#true} ~cond := #in~cond; {2230#true} is VALID [2018-11-18 22:57:53,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {2230#true} assume !(0 == ~cond); {2230#true} is VALID [2018-11-18 22:57:53,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {2230#true} assume true; {2230#true} is VALID [2018-11-18 22:57:53,193 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2230#true} {2231#false} #79#return; {2231#false} is VALID [2018-11-18 22:57:53,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {2231#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {2231#false} #t~short5 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {2231#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {2231#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L256 TraceCheckUtils]: 43: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2018-11-18 22:57:53,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {2231#false} assume 0 == ~cond; {2231#false} is VALID [2018-11-18 22:57:53,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2018-11-18 22:57:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:57:53,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:53,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:53,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:53,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:53,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2018-11-18 22:57:53,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {2230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2230#true} is VALID [2018-11-18 22:57:53,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2018-11-18 22:57:53,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #75#return; {2230#true} is VALID [2018-11-18 22:57:53,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret8 := main(); {2230#true} is VALID [2018-11-18 22:57:53,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {2230#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2257#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:53,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {2257#(<= main_~j~0 0)} assume true; {2257#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:53,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {2257#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2233#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:53,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {2233#(<= main_~j~0 1)} assume true; {2233#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:53,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {2233#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2234#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:53,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {2234#(<= main_~j~0 2)} assume true; {2234#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:53,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {2234#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2235#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:53,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {2235#(<= main_~j~0 3)} assume true; {2235#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:53,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {2235#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2236#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:53,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {2236#(<= main_~j~0 4)} assume true; {2236#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:53,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {2236#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2237#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:53,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {2237#(<= main_~j~0 5)} assume true; {2237#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:53,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {2237#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2238#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:53,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {2238#(<= main_~j~0 6)} assume true; {2238#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:53,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {2238#(<= main_~j~0 6)} assume !(~j~0 < 100000); {2231#false} is VALID [2018-11-18 22:57:53,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {2231#false} #t~short2 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {2231#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2231#false} is VALID [2018-11-18 22:57:53,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {2231#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {2231#false} is VALID [2018-11-18 22:57:53,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {2231#false} #t~short2 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {2231#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {2231#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {2231#false} ~i~0 := 0; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {2231#false} #t~short5 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {2231#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {2231#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2231#false} is VALID [2018-11-18 22:57:53,415 INFO L256 TraceCheckUtils]: 33: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {2231#false} assume !(0 == ~cond); {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2231#false} {2231#false} #79#return; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {2231#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {2231#false} assume true; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {2231#false} #t~short5 := ~i~0 < 100000; {2231#false} is VALID [2018-11-18 22:57:53,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {2231#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2231#false} is VALID [2018-11-18 22:57:53,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {2231#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2231#false} is VALID [2018-11-18 22:57:53,417 INFO L256 TraceCheckUtils]: 43: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2231#false} is VALID [2018-11-18 22:57:53,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2018-11-18 22:57:53,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {2231#false} assume 0 == ~cond; {2231#false} is VALID [2018-11-18 22:57:53,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2018-11-18 22:57:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:57:53,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:53,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:57:53,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-18 22:57:53,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:53,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:57:53,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:53,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:57:53,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:57:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:57:53,479 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 10 states. [2018-11-18 22:57:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,801 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-18 22:57:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:57:53,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-18 22:57:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:57:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-18 22:57:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:57:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-18 22:57:53,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2018-11-18 22:57:53,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:53,861 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:57:53,861 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 22:57:53,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:57:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 22:57:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-18 22:57:53,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:53,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-18 22:57:53,913 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-18 22:57:53,913 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-18 22:57:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,915 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-18 22:57:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-18 22:57:53,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:53,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:53,916 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-18 22:57:53,916 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-18 22:57:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:53,917 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-18 22:57:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-18 22:57:53,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:53,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:53,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:53,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:57:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-18 22:57:53,919 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 47 [2018-11-18 22:57:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:53,919 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-18 22:57:53,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:57:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-18 22:57:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 22:57:53,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:53,920 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:53,920 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1366278672, now seen corresponding path program 2 times [2018-11-18 22:57:53,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:53,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:53,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:54,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {2660#true} call ULTIMATE.init(); {2660#true} is VALID [2018-11-18 22:57:54,150 INFO L273 TraceCheckUtils]: 1: Hoare triple {2660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2660#true} is VALID [2018-11-18 22:57:54,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {2660#true} assume true; {2660#true} is VALID [2018-11-18 22:57:54,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2660#true} {2660#true} #75#return; {2660#true} is VALID [2018-11-18 22:57:54,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {2660#true} call #t~ret8 := main(); {2660#true} is VALID [2018-11-18 22:57:54,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {2660#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2662#(= main_~j~0 0)} is VALID [2018-11-18 22:57:54,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {2662#(= main_~j~0 0)} assume true; {2662#(= main_~j~0 0)} is VALID [2018-11-18 22:57:54,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {2662#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2663#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:54,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {2663#(<= main_~j~0 1)} assume true; {2663#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:54,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {2663#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2664#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:54,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {2664#(<= main_~j~0 2)} assume true; {2664#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:54,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {2664#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2665#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:54,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {2665#(<= main_~j~0 3)} assume true; {2665#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:54,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {2665#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2666#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:54,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {2666#(<= main_~j~0 4)} assume true; {2666#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:54,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {2666#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2667#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:54,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {2667#(<= main_~j~0 5)} assume true; {2667#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:54,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {2667#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2668#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:54,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {2668#(<= main_~j~0 6)} assume true; {2668#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:54,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {2668#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2669#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:54,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {2669#(<= main_~j~0 7)} assume true; {2669#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:54,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {2669#(<= main_~j~0 7)} assume !(~j~0 < 100000); {2661#false} is VALID [2018-11-18 22:57:54,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {2661#false} #t~short2 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {2661#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2661#false} is VALID [2018-11-18 22:57:54,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {2661#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {2661#false} is VALID [2018-11-18 22:57:54,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {2661#false} #t~short2 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {2661#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2661#false} is VALID [2018-11-18 22:57:54,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {2661#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L273 TraceCheckUtils]: 30: Hoare triple {2661#false} ~i~0 := 0; {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {2661#false} #t~short5 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {2661#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {2661#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2661#false} is VALID [2018-11-18 22:57:54,163 INFO L256 TraceCheckUtils]: 35: Hoare triple {2661#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2660#true} is VALID [2018-11-18 22:57:54,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {2660#true} ~cond := #in~cond; {2660#true} is VALID [2018-11-18 22:57:54,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {2660#true} assume !(0 == ~cond); {2660#true} is VALID [2018-11-18 22:57:54,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {2660#true} assume true; {2660#true} is VALID [2018-11-18 22:57:54,164 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2660#true} {2661#false} #79#return; {2661#false} is VALID [2018-11-18 22:57:54,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {2661#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {2661#false} is VALID [2018-11-18 22:57:54,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {2661#false} #t~short5 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {2661#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2661#false} is VALID [2018-11-18 22:57:54,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {2661#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2661#false} is VALID [2018-11-18 22:57:54,165 INFO L256 TraceCheckUtils]: 45: Hoare triple {2661#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2661#false} is VALID [2018-11-18 22:57:54,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {2661#false} ~cond := #in~cond; {2661#false} is VALID [2018-11-18 22:57:54,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {2661#false} assume 0 == ~cond; {2661#false} is VALID [2018-11-18 22:57:54,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {2661#false} assume !false; {2661#false} is VALID [2018-11-18 22:57:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:57:54,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:54,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:54,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:54,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:54,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:54,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {2660#true} call ULTIMATE.init(); {2660#true} is VALID [2018-11-18 22:57:54,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {2660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2660#true} is VALID [2018-11-18 22:57:54,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {2660#true} assume true; {2660#true} is VALID [2018-11-18 22:57:54,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2660#true} {2660#true} #75#return; {2660#true} is VALID [2018-11-18 22:57:54,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {2660#true} call #t~ret8 := main(); {2660#true} is VALID [2018-11-18 22:57:54,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {2660#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2688#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:54,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {2688#(<= main_~j~0 0)} assume true; {2688#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:54,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {2688#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2663#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:54,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {2663#(<= main_~j~0 1)} assume true; {2663#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:54,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {2663#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2664#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:54,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {2664#(<= main_~j~0 2)} assume true; {2664#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:54,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {2664#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2665#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:54,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {2665#(<= main_~j~0 3)} assume true; {2665#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:54,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {2665#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2666#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:54,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {2666#(<= main_~j~0 4)} assume true; {2666#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:54,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {2666#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2667#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:54,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2667#(<= main_~j~0 5)} assume true; {2667#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:54,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2667#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2668#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:54,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {2668#(<= main_~j~0 6)} assume true; {2668#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:54,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {2668#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2669#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:54,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {2669#(<= main_~j~0 7)} assume true; {2669#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:54,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {2669#(<= main_~j~0 7)} assume !(~j~0 < 100000); {2661#false} is VALID [2018-11-18 22:57:54,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {2661#false} #t~short2 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {2661#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2661#false} is VALID [2018-11-18 22:57:54,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {2661#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {2661#false} is VALID [2018-11-18 22:57:54,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,381 INFO L273 TraceCheckUtils]: 27: Hoare triple {2661#false} #t~short2 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {2661#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {2661#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {2661#false} ~i~0 := 0; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {2661#false} #t~short5 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {2661#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2661#false} is VALID [2018-11-18 22:57:54,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {2661#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2661#false} is VALID [2018-11-18 22:57:54,383 INFO L256 TraceCheckUtils]: 35: Hoare triple {2661#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2661#false} is VALID [2018-11-18 22:57:54,383 INFO L273 TraceCheckUtils]: 36: Hoare triple {2661#false} ~cond := #in~cond; {2661#false} is VALID [2018-11-18 22:57:54,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {2661#false} assume !(0 == ~cond); {2661#false} is VALID [2018-11-18 22:57:54,383 INFO L273 TraceCheckUtils]: 38: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,383 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2661#false} {2661#false} #79#return; {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L273 TraceCheckUtils]: 40: Hoare triple {2661#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L273 TraceCheckUtils]: 41: Hoare triple {2661#false} assume true; {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {2661#false} #t~short5 := ~i~0 < 100000; {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {2661#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {2661#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {2661#false} is VALID [2018-11-18 22:57:54,384 INFO L256 TraceCheckUtils]: 45: Hoare triple {2661#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2661#false} is VALID [2018-11-18 22:57:54,385 INFO L273 TraceCheckUtils]: 46: Hoare triple {2661#false} ~cond := #in~cond; {2661#false} is VALID [2018-11-18 22:57:54,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {2661#false} assume 0 == ~cond; {2661#false} is VALID [2018-11-18 22:57:54,385 INFO L273 TraceCheckUtils]: 48: Hoare triple {2661#false} assume !false; {2661#false} is VALID [2018-11-18 22:57:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:57:54,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:54,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:57:54,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-18 22:57:54,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:54,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:57:54,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:54,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:57:54,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:57:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:57:54,516 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2018-11-18 22:57:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:54,879 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-18 22:57:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:57:54,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-18 22:57:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:57:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-18 22:57:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:57:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-18 22:57:54,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 64 transitions. [2018-11-18 22:57:54,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:54,977 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:57:54,977 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 22:57:54,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:57:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 22:57:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-18 22:57:55,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:55,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-18 22:57:55,032 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-18 22:57:55,033 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-18 22:57:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:55,035 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-18 22:57:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-18 22:57:55,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:55,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:55,036 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-18 22:57:55,036 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-18 22:57:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:55,037 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-18 22:57:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-18 22:57:55,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:55,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:55,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:55,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 22:57:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-11-18 22:57:55,040 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 49 [2018-11-18 22:57:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:55,040 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-11-18 22:57:55,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:57:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-18 22:57:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:57:55,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:55,041 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:55,041 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:55,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1515716490, now seen corresponding path program 3 times [2018-11-18 22:57:55,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:55,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:55,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:55,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {3107#true} call ULTIMATE.init(); {3107#true} is VALID [2018-11-18 22:57:55,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {3107#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3107#true} is VALID [2018-11-18 22:57:55,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {3107#true} assume true; {3107#true} is VALID [2018-11-18 22:57:55,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3107#true} {3107#true} #75#return; {3107#true} is VALID [2018-11-18 22:57:55,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {3107#true} call #t~ret8 := main(); {3107#true} is VALID [2018-11-18 22:57:55,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {3107#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3109#(= main_~j~0 0)} is VALID [2018-11-18 22:57:55,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#(= main_~j~0 0)} assume true; {3109#(= main_~j~0 0)} is VALID [2018-11-18 22:57:55,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {3109#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3110#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:55,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {3110#(<= main_~j~0 1)} assume true; {3110#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:55,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {3110#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3111#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:55,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {3111#(<= main_~j~0 2)} assume true; {3111#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:55,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {3111#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3112#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:55,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {3112#(<= main_~j~0 3)} assume true; {3112#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:55,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {3112#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3113#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:55,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {3113#(<= main_~j~0 4)} assume true; {3113#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:55,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {3113#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3114#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:55,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(<= main_~j~0 5)} assume true; {3114#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:55,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {3114#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3115#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:55,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {3115#(<= main_~j~0 6)} assume true; {3115#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:55,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {3115#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3116#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:55,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {3116#(<= main_~j~0 7)} assume true; {3116#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:55,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {3116#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3117#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:55,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {3117#(<= main_~j~0 8)} assume true; {3117#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:55,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {3117#(<= main_~j~0 8)} assume !(~j~0 < 100000); {3108#false} is VALID [2018-11-18 22:57:55,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {3108#false} assume true; {3108#false} is VALID [2018-11-18 22:57:55,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {3108#false} #t~short2 := ~i~0 < 100000; {3108#false} is VALID [2018-11-18 22:57:55,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {3108#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3108#false} is VALID [2018-11-18 22:57:55,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {3108#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {3108#false} is VALID [2018-11-18 22:57:55,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {3108#false} assume true; {3108#false} is VALID [2018-11-18 22:57:55,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {3108#false} #t~short2 := ~i~0 < 100000; {3108#false} is VALID [2018-11-18 22:57:55,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {3108#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3108#false} is VALID [2018-11-18 22:57:55,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {3108#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {3108#false} is VALID [2018-11-18 22:57:55,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {3108#false} ~i~0 := 0; {3108#false} is VALID [2018-11-18 22:57:55,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {3108#false} assume true; {3108#false} is VALID [2018-11-18 22:57:55,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {3108#false} #t~short5 := ~i~0 < 100000; {3108#false} is VALID [2018-11-18 22:57:55,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {3108#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3108#false} is VALID [2018-11-18 22:57:55,209 INFO L273 TraceCheckUtils]: 36: Hoare triple {3108#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3108#false} is VALID [2018-11-18 22:57:55,210 INFO L256 TraceCheckUtils]: 37: Hoare triple {3108#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3107#true} is VALID [2018-11-18 22:57:55,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {3107#true} ~cond := #in~cond; {3107#true} is VALID [2018-11-18 22:57:55,210 INFO L273 TraceCheckUtils]: 39: Hoare triple {3107#true} assume !(0 == ~cond); {3107#true} is VALID [2018-11-18 22:57:55,210 INFO L273 TraceCheckUtils]: 40: Hoare triple {3107#true} assume true; {3107#true} is VALID [2018-11-18 22:57:55,210 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3107#true} {3108#false} #79#return; {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {3108#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {3108#false} assume true; {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {3108#false} #t~short5 := ~i~0 < 100000; {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 45: Hoare triple {3108#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {3108#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L256 TraceCheckUtils]: 47: Hoare triple {3108#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3108#false} is VALID [2018-11-18 22:57:55,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {3108#false} ~cond := #in~cond; {3108#false} is VALID [2018-11-18 22:57:55,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {3108#false} assume 0 == ~cond; {3108#false} is VALID [2018-11-18 22:57:55,212 INFO L273 TraceCheckUtils]: 50: Hoare triple {3108#false} assume !false; {3108#false} is VALID [2018-11-18 22:57:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:57:55,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:55,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:55,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 22:57:55,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:55,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:55,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {3107#true} call ULTIMATE.init(); {3107#true} is VALID [2018-11-18 22:57:55,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {3107#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3107#true} is VALID [2018-11-18 22:57:55,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {3107#true} assume true; {3107#true} is VALID [2018-11-18 22:57:55,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3107#true} {3107#true} #75#return; {3107#true} is VALID [2018-11-18 22:57:55,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {3107#true} call #t~ret8 := main(); {3107#true} is VALID [2018-11-18 22:57:55,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {3107#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {3136#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 22:57:55,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume true; {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 22:57:55,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} #t~short2 := ~i~0 < 100000; {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 22:57:55,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {3203#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3213#(and (or (and (not |main_#t~short2|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0)) (and (not (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0)) |main_#t~short2|)) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 22:57:55,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {3213#(and (or (and (not |main_#t~short2|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0)) (and (not (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0)) |main_#t~short2|)) (= 0 |main_~#src~0.offset|))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {3217#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} is VALID [2018-11-18 22:57:55,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {3217#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} ~i~0 := 0; {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} assume true; {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,799 INFO L256 TraceCheckUtils]: 37: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 22:57:55,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 22:57:55,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} assume !(0 == ~cond); {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 22:57:55,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} assume true; {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-18 22:57:55,824 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3237#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))} {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} #79#return; {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} is VALID [2018-11-18 22:57:55,824 INFO L273 TraceCheckUtils]: 42: Hoare triple {3221#(and (= 0 |main_~#src~0.offset|) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} is VALID [2018-11-18 22:57:55,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} assume true; {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} is VALID [2018-11-18 22:57:55,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} #t~short5 := ~i~0 < 100000; {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} is VALID [2018-11-18 22:57:55,826 INFO L273 TraceCheckUtils]: 45: Hoare triple {3253#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4)) 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3263#(not |main_#t~short5|)} is VALID [2018-11-18 22:57:55,826 INFO L273 TraceCheckUtils]: 46: Hoare triple {3263#(not |main_#t~short5|)} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3108#false} is VALID [2018-11-18 22:57:55,827 INFO L256 TraceCheckUtils]: 47: Hoare triple {3108#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3108#false} is VALID [2018-11-18 22:57:55,827 INFO L273 TraceCheckUtils]: 48: Hoare triple {3108#false} ~cond := #in~cond; {3108#false} is VALID [2018-11-18 22:57:55,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {3108#false} assume 0 == ~cond; {3108#false} is VALID [2018-11-18 22:57:55,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {3108#false} assume !false; {3108#false} is VALID [2018-11-18 22:57:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:57:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-18 22:57:55,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-18 22:57:55,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:55,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:57:55,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:55,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:57:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:57:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:57:55,924 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 19 states. [2018-11-18 22:57:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:57,566 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-11-18 22:57:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:57:57,566 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-18 22:57:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:57:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 108 transitions. [2018-11-18 22:57:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:57:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 108 transitions. [2018-11-18 22:57:57,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 108 transitions. [2018-11-18 22:57:57,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:57,728 INFO L225 Difference]: With dead ends: 119 [2018-11-18 22:57:57,728 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 22:57:57,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 22:57:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-11-18 22:57:57,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:57,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 60 states. [2018-11-18 22:57:57,783 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 60 states. [2018-11-18 22:57:57,783 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 60 states. [2018-11-18 22:57:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:57,787 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-18 22:57:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-18 22:57:57,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:57,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:57,787 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 74 states. [2018-11-18 22:57:57,788 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 74 states. [2018-11-18 22:57:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:57,790 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-18 22:57:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-18 22:57:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:57,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:57,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:57,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 22:57:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-18 22:57:57,793 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-18 22:57:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-18 22:57:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:57:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-18 22:57:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:57:57,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:57,794 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:57,794 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:57,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1281863078, now seen corresponding path program 1 times [2018-11-18 22:57:57,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:57,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:57,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:57,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-18 22:57:57,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-18 22:57:57,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-18 22:57:57,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #75#return; {3681#true} is VALID [2018-11-18 22:57:57,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret8 := main(); {3681#true} is VALID [2018-11-18 22:57:57,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3683#(= main_~j~0 0)} is VALID [2018-11-18 22:57:57,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {3683#(= main_~j~0 0)} assume true; {3683#(= main_~j~0 0)} is VALID [2018-11-18 22:57:57,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {3683#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3684#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:57,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= main_~j~0 1)} assume true; {3684#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:57,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3685#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:57,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= main_~j~0 2)} assume true; {3685#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:57,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3686#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:57,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= main_~j~0 3)} assume true; {3686#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:57,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3687#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:57,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= main_~j~0 4)} assume true; {3687#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:57,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3688#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:57,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= main_~j~0 5)} assume true; {3688#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:57,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3689#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:57,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= main_~j~0 6)} assume true; {3689#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:57,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3690#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:57,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~j~0 7)} assume true; {3690#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:57,986 INFO L273 TraceCheckUtils]: 21: Hoare triple {3690#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3691#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:57,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {3691#(<= main_~j~0 8)} assume true; {3691#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:57,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {3691#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3692#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:57,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {3692#(<= main_~j~0 9)} assume true; {3692#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:57,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {3692#(<= main_~j~0 9)} assume !(~j~0 < 100000); {3682#false} is VALID [2018-11-18 22:57:57,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:57,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~short2 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:57,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3682#false} is VALID [2018-11-18 22:57:57,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {3682#false} is VALID [2018-11-18 22:57:57,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:57,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~short2 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:57,991 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !#t~short2; {3682#false} is VALID [2018-11-18 22:57:57,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {3682#false} is VALID [2018-11-18 22:57:57,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-18 22:57:57,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:57,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} #t~short5 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:57,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3682#false} is VALID [2018-11-18 22:57:57,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3682#false} is VALID [2018-11-18 22:57:57,992 INFO L256 TraceCheckUtils]: 39: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3681#true} is VALID [2018-11-18 22:57:57,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2018-11-18 22:57:57,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2018-11-18 22:57:57,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-18 22:57:57,993 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3681#true} {3682#false} #79#return; {3682#false} is VALID [2018-11-18 22:57:57,993 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {3682#false} is VALID [2018-11-18 22:57:57,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:57,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} #t~short5 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L256 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-18 22:57:57,994 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-18 22:57:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:57:57,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:57,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:58,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:58,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-18 22:57:58,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-18 22:57:58,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-18 22:57:58,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #75#return; {3681#true} is VALID [2018-11-18 22:57:58,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret8 := main(); {3681#true} is VALID [2018-11-18 22:57:58,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3711#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:58,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {3711#(<= main_~j~0 0)} assume true; {3711#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:58,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {3711#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3684#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:58,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= main_~j~0 1)} assume true; {3684#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:58,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3685#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:58,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= main_~j~0 2)} assume true; {3685#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:58,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3686#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:58,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= main_~j~0 3)} assume true; {3686#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:58,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3687#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:58,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= main_~j~0 4)} assume true; {3687#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:58,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3688#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:58,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= main_~j~0 5)} assume true; {3688#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:58,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3689#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:58,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= main_~j~0 6)} assume true; {3689#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:58,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3690#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:58,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~j~0 7)} assume true; {3690#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:58,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {3690#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3691#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:58,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {3691#(<= main_~j~0 8)} assume true; {3691#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:58,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {3691#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3692#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:58,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {3692#(<= main_~j~0 9)} assume true; {3692#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {3692#(<= main_~j~0 9)} assume !(~j~0 < 100000); {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~short2 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~short2 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:58,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !#t~short2; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} #t~short5 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L256 TraceCheckUtils]: 39: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3682#false} is VALID [2018-11-18 22:57:58,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 42: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3682#false} {3682#false} #79#return; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} #t~short5 := ~i~0 < 100000; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3682#false} is VALID [2018-11-18 22:57:58,180 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {3682#false} is VALID [2018-11-18 22:57:58,181 INFO L256 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3682#false} is VALID [2018-11-18 22:57:58,181 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-18 22:57:58,181 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-18 22:57:58,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-18 22:57:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:57:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:57:58,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-18 22:57:58,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:58,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:57:58,334 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-18 22:57:58,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:57:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:57:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:57:58,335 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-11-18 22:57:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:58,613 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-18 22:57:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:57:58,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-18 22:57:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:57:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2018-11-18 22:57:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:57:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2018-11-18 22:57:58,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2018-11-18 22:57:58,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:58,678 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:57:58,678 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 22:57:58,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:57:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 22:57:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-18 22:57:58,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:58,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-18 22:57:58,757 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-18 22:57:58,757 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-18 22:57:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:58,760 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-18 22:57:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 22:57:58,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:58,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:58,761 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-18 22:57:58,761 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-18 22:57:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:58,763 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-18 22:57:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 22:57:58,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:58,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:58,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:58,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:57:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-18 22:57:58,765 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 53 [2018-11-18 22:57:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:58,765 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-18 22:57:58,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:57:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-18 22:57:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 22:57:58,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:58,766 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:58,767 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:58,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1692471872, now seen corresponding path program 2 times [2018-11-18 22:57:58,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:59,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4182#true} is VALID [2018-11-18 22:57:59,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {4182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4182#true} is VALID [2018-11-18 22:57:59,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2018-11-18 22:57:59,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #75#return; {4182#true} is VALID [2018-11-18 22:57:59,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret8 := main(); {4182#true} is VALID [2018-11-18 22:57:59,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {4182#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4184#(= main_~j~0 0)} is VALID [2018-11-18 22:57:59,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {4184#(= main_~j~0 0)} assume true; {4184#(= main_~j~0 0)} is VALID [2018-11-18 22:57:59,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {4184#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4185#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:59,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {4185#(<= main_~j~0 1)} assume true; {4185#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:59,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {4185#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4186#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:59,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {4186#(<= main_~j~0 2)} assume true; {4186#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:59,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {4186#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4187#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:59,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {4187#(<= main_~j~0 3)} assume true; {4187#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:59,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {4187#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4188#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:59,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {4188#(<= main_~j~0 4)} assume true; {4188#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:59,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {4188#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4189#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:59,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {4189#(<= main_~j~0 5)} assume true; {4189#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:59,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {4189#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4190#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:59,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {4190#(<= main_~j~0 6)} assume true; {4190#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:59,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {4190#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4191#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:59,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {4191#(<= main_~j~0 7)} assume true; {4191#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:59,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {4191#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4192#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:59,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {4192#(<= main_~j~0 8)} assume true; {4192#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:59,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {4192#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4193#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:59,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#(<= main_~j~0 9)} assume true; {4193#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:59,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4194#(<= main_~j~0 10)} is VALID [2018-11-18 22:57:59,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {4194#(<= main_~j~0 10)} assume true; {4194#(<= main_~j~0 10)} is VALID [2018-11-18 22:57:59,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {4194#(<= main_~j~0 10)} assume !(~j~0 < 100000); {4183#false} is VALID [2018-11-18 22:57:59,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {4183#false} #t~short2 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {4183#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4183#false} is VALID [2018-11-18 22:57:59,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {4183#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {4183#false} is VALID [2018-11-18 22:57:59,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {4183#false} #t~short2 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {4183#false} assume !#t~short2; {4183#false} is VALID [2018-11-18 22:57:59,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {4183#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {4183#false} is VALID [2018-11-18 22:57:59,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {4183#false} ~i~0 := 0; {4183#false} is VALID [2018-11-18 22:57:59,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {4183#false} #t~short5 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {4183#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4183#false} is VALID [2018-11-18 22:57:59,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {4183#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4183#false} is VALID [2018-11-18 22:57:59,271 INFO L256 TraceCheckUtils]: 41: Hoare triple {4183#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4182#true} is VALID [2018-11-18 22:57:59,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2018-11-18 22:57:59,271 INFO L273 TraceCheckUtils]: 43: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2018-11-18 22:57:59,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {4182#true} assume true; {4182#true} is VALID [2018-11-18 22:57:59,272 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4182#true} {4183#false} #79#return; {4183#false} is VALID [2018-11-18 22:57:59,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {4183#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {4183#false} is VALID [2018-11-18 22:57:59,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {4183#false} #t~short5 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {4183#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {4183#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L256 TraceCheckUtils]: 51: Hoare triple {4183#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {4183#false} ~cond := #in~cond; {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {4183#false} assume 0 == ~cond; {4183#false} is VALID [2018-11-18 22:57:59,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2018-11-18 22:57:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:57:59,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:59,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:59,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:59,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:59,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:59,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:59,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4182#true} is VALID [2018-11-18 22:57:59,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {4182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4182#true} is VALID [2018-11-18 22:57:59,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2018-11-18 22:57:59,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #75#return; {4182#true} is VALID [2018-11-18 22:57:59,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret8 := main(); {4182#true} is VALID [2018-11-18 22:57:59,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {4182#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4213#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:59,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {4213#(<= main_~j~0 0)} assume true; {4213#(<= main_~j~0 0)} is VALID [2018-11-18 22:57:59,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {4213#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4185#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:59,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {4185#(<= main_~j~0 1)} assume true; {4185#(<= main_~j~0 1)} is VALID [2018-11-18 22:57:59,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {4185#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4186#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:59,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {4186#(<= main_~j~0 2)} assume true; {4186#(<= main_~j~0 2)} is VALID [2018-11-18 22:57:59,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {4186#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4187#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:59,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {4187#(<= main_~j~0 3)} assume true; {4187#(<= main_~j~0 3)} is VALID [2018-11-18 22:57:59,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {4187#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4188#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:59,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {4188#(<= main_~j~0 4)} assume true; {4188#(<= main_~j~0 4)} is VALID [2018-11-18 22:57:59,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {4188#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4189#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:59,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {4189#(<= main_~j~0 5)} assume true; {4189#(<= main_~j~0 5)} is VALID [2018-11-18 22:57:59,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {4189#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4190#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:59,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {4190#(<= main_~j~0 6)} assume true; {4190#(<= main_~j~0 6)} is VALID [2018-11-18 22:57:59,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {4190#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4191#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:59,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {4191#(<= main_~j~0 7)} assume true; {4191#(<= main_~j~0 7)} is VALID [2018-11-18 22:57:59,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {4191#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4192#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:59,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {4192#(<= main_~j~0 8)} assume true; {4192#(<= main_~j~0 8)} is VALID [2018-11-18 22:57:59,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {4192#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4193#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:59,495 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#(<= main_~j~0 9)} assume true; {4193#(<= main_~j~0 9)} is VALID [2018-11-18 22:57:59,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4194#(<= main_~j~0 10)} is VALID [2018-11-18 22:57:59,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {4194#(<= main_~j~0 10)} assume true; {4194#(<= main_~j~0 10)} is VALID [2018-11-18 22:57:59,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {4194#(<= main_~j~0 10)} assume !(~j~0 < 100000); {4183#false} is VALID [2018-11-18 22:57:59,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {4183#false} #t~short2 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {4183#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4183#false} is VALID [2018-11-18 22:57:59,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {4183#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {4183#false} is VALID [2018-11-18 22:57:59,498 INFO L273 TraceCheckUtils]: 32: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {4183#false} #t~short2 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {4183#false} assume !#t~short2; {4183#false} is VALID [2018-11-18 22:57:59,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {4183#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {4183#false} is VALID [2018-11-18 22:57:59,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {4183#false} ~i~0 := 0; {4183#false} is VALID [2018-11-18 22:57:59,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 38: Hoare triple {4183#false} #t~short5 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {4183#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {4183#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L256 TraceCheckUtils]: 41: Hoare triple {4183#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {4183#false} ~cond := #in~cond; {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {4183#false} assume !(0 == ~cond); {4183#false} is VALID [2018-11-18 22:57:59,500 INFO L273 TraceCheckUtils]: 44: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4183#false} {4183#false} #79#return; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 46: Hoare triple {4183#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {4183#false} assume true; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 48: Hoare triple {4183#false} #t~short5 := ~i~0 < 100000; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 49: Hoare triple {4183#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 50: Hoare triple {4183#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L256 TraceCheckUtils]: 51: Hoare triple {4183#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 52: Hoare triple {4183#false} ~cond := #in~cond; {4183#false} is VALID [2018-11-18 22:57:59,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {4183#false} assume 0 == ~cond; {4183#false} is VALID [2018-11-18 22:57:59,502 INFO L273 TraceCheckUtils]: 54: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2018-11-18 22:57:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:57:59,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:59,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:57:59,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:57:59,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:59,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:57:59,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:57:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:57:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:57:59,575 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 14 states. [2018-11-18 22:57:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:59,750 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-18 22:57:59,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:57:59,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:57:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:57:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-18 22:57:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:57:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-18 22:57:59,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 70 transitions. [2018-11-18 22:58:00,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:00,613 INFO L225 Difference]: With dead ends: 98 [2018-11-18 22:58:00,613 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 22:58:00,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:58:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 22:58:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-18 22:58:01,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:01,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-18 22:58:01,198 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-18 22:58:01,198 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-18 22:58:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:01,201 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-18 22:58:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-18 22:58:01,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:01,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:01,201 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-18 22:58:01,202 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-18 22:58:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:01,203 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-18 22:58:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-18 22:58:01,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:01,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:01,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:01,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:58:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-18 22:58:01,205 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2018-11-18 22:58:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:01,205 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-18 22:58:01,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:58:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-18 22:58:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 22:58:01,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:01,206 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:01,206 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:01,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1150531674, now seen corresponding path program 3 times [2018-11-18 22:58:01,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:01,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:01,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:01,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:01,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:02,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {4700#true} call ULTIMATE.init(); {4700#true} is VALID [2018-11-18 22:58:02,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {4700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4700#true} is VALID [2018-11-18 22:58:02,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {4700#true} assume true; {4700#true} is VALID [2018-11-18 22:58:02,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} #75#return; {4700#true} is VALID [2018-11-18 22:58:02,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {4700#true} call #t~ret8 := main(); {4700#true} is VALID [2018-11-18 22:58:02,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {4700#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4702#(= main_~j~0 0)} is VALID [2018-11-18 22:58:02,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {4702#(= main_~j~0 0)} assume true; {4702#(= main_~j~0 0)} is VALID [2018-11-18 22:58:02,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {4702#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4703#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:02,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {4703#(<= main_~j~0 1)} assume true; {4703#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:02,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {4703#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4704#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:02,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {4704#(<= main_~j~0 2)} assume true; {4704#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:02,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {4704#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4705#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:02,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {4705#(<= main_~j~0 3)} assume true; {4705#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:02,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {4705#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4706#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:02,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {4706#(<= main_~j~0 4)} assume true; {4706#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:02,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {4706#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4707#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:02,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {4707#(<= main_~j~0 5)} assume true; {4707#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:02,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {4707#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4708#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:02,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {4708#(<= main_~j~0 6)} assume true; {4708#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:02,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {4708#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4709#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:02,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {4709#(<= main_~j~0 7)} assume true; {4709#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:02,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {4709#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4710#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:02,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {4710#(<= main_~j~0 8)} assume true; {4710#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:02,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {4710#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4711#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:02,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {4711#(<= main_~j~0 9)} assume true; {4711#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:02,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {4711#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4712#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:02,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {4712#(<= main_~j~0 10)} assume true; {4712#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:02,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {4712#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4713#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:02,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {4713#(<= main_~j~0 11)} assume true; {4713#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:02,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {4713#(<= main_~j~0 11)} assume !(~j~0 < 100000); {4701#false} is VALID [2018-11-18 22:58:02,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {4701#false} #t~short2 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {4701#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4701#false} is VALID [2018-11-18 22:58:02,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {4701#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {4701#false} is VALID [2018-11-18 22:58:02,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,381 INFO L273 TraceCheckUtils]: 35: Hoare triple {4701#false} #t~short2 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {4701#false} assume !#t~short2; {4701#false} is VALID [2018-11-18 22:58:02,382 INFO L273 TraceCheckUtils]: 37: Hoare triple {4701#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {4701#false} is VALID [2018-11-18 22:58:02,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {4701#false} ~i~0 := 0; {4701#false} is VALID [2018-11-18 22:58:02,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {4701#false} #t~short5 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {4701#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4701#false} is VALID [2018-11-18 22:58:02,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {4701#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4701#false} is VALID [2018-11-18 22:58:02,383 INFO L256 TraceCheckUtils]: 43: Hoare triple {4701#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4700#true} is VALID [2018-11-18 22:58:02,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2018-11-18 22:58:02,383 INFO L273 TraceCheckUtils]: 45: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2018-11-18 22:58:02,384 INFO L273 TraceCheckUtils]: 46: Hoare triple {4700#true} assume true; {4700#true} is VALID [2018-11-18 22:58:02,384 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4700#true} {4701#false} #79#return; {4701#false} is VALID [2018-11-18 22:58:02,384 INFO L273 TraceCheckUtils]: 48: Hoare triple {4701#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {4701#false} is VALID [2018-11-18 22:58:02,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 50: Hoare triple {4701#false} #t~short5 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 51: Hoare triple {4701#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 52: Hoare triple {4701#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L256 TraceCheckUtils]: 53: Hoare triple {4701#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {4701#false} ~cond := #in~cond; {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {4701#false} assume 0 == ~cond; {4701#false} is VALID [2018-11-18 22:58:02,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {4701#false} assume !false; {4701#false} is VALID [2018-11-18 22:58:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 22:58:02,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:02,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:02,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:58:02,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 22:58:02,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:02,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:02,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {4700#true} call ULTIMATE.init(); {4700#true} is VALID [2018-11-18 22:58:02,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {4700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4700#true} is VALID [2018-11-18 22:58:02,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {4700#true} assume true; {4700#true} is VALID [2018-11-18 22:58:02,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} #75#return; {4700#true} is VALID [2018-11-18 22:58:02,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {4700#true} call #t~ret8 := main(); {4700#true} is VALID [2018-11-18 22:58:02,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {4700#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {4732#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {4732#(<= main_~i~0 0)} assume !(~j~0 < 100000); {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {4732#(<= main_~i~0 0)} assume true; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {4732#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,578 INFO L273 TraceCheckUtils]: 32: Hoare triple {4732#(<= main_~i~0 0)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4732#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {4732#(<= main_~i~0 0)} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {4817#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {4817#(<= main_~i~0 1)} assume true; {4817#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {4817#(<= main_~i~0 1)} #t~short2 := ~i~0 < 100000; {4824#|main_#t~short2|} is VALID [2018-11-18 22:58:02,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {4824#|main_#t~short2|} assume !#t~short2; {4701#false} is VALID [2018-11-18 22:58:02,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {4701#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {4701#false} is VALID [2018-11-18 22:58:02,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {4701#false} ~i~0 := 0; {4701#false} is VALID [2018-11-18 22:58:02,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,582 INFO L273 TraceCheckUtils]: 40: Hoare triple {4701#false} #t~short5 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {4701#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4701#false} is VALID [2018-11-18 22:58:02,582 INFO L273 TraceCheckUtils]: 42: Hoare triple {4701#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4701#false} is VALID [2018-11-18 22:58:02,582 INFO L256 TraceCheckUtils]: 43: Hoare triple {4701#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {4701#false} ~cond := #in~cond; {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {4701#false} assume !(0 == ~cond); {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L273 TraceCheckUtils]: 46: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4701#false} {4701#false} #79#return; {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {4701#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {4701#false} is VALID [2018-11-18 22:58:02,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {4701#false} assume true; {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {4701#false} #t~short5 := ~i~0 < 100000; {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 51: Hoare triple {4701#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 52: Hoare triple {4701#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L256 TraceCheckUtils]: 53: Hoare triple {4701#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 54: Hoare triple {4701#false} ~cond := #in~cond; {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 55: Hoare triple {4701#false} assume 0 == ~cond; {4701#false} is VALID [2018-11-18 22:58:02,584 INFO L273 TraceCheckUtils]: 56: Hoare triple {4701#false} assume !false; {4701#false} is VALID [2018-11-18 22:58:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-18 22:58:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:02,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2018-11-18 22:58:02,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-18 22:58:02,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:02,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:58:02,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:02,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:58:02,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:58:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:58:02,665 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 17 states. [2018-11-18 22:58:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:03,504 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-11-18 22:58:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:58:03,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-18 22:58:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:58:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2018-11-18 22:58:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:58:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2018-11-18 22:58:03,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 95 transitions. [2018-11-18 22:58:03,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:03,622 INFO L225 Difference]: With dead ends: 107 [2018-11-18 22:58:03,622 INFO L226 Difference]: Without dead ends: 73 [2018-11-18 22:58:03,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=630, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:58:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-18 22:58:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-11-18 22:58:03,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:03,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 66 states. [2018-11-18 22:58:03,800 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 66 states. [2018-11-18 22:58:03,800 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 66 states. [2018-11-18 22:58:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:03,803 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-18 22:58:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-18 22:58:03,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:03,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 73 states. [2018-11-18 22:58:03,804 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 73 states. [2018-11-18 22:58:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:03,806 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-18 22:58:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-18 22:58:03,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:03,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:03,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:03,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 22:58:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-18 22:58:03,808 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 57 [2018-11-18 22:58:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:03,809 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-18 22:58:03,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:58:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-18 22:58:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 22:58:03,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:03,810 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:03,810 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:03,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1346138040, now seen corresponding path program 4 times [2018-11-18 22:58:03,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:03,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:04,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-18 22:58:04,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-18 22:58:04,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-18 22:58:04,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #75#return; {5288#true} is VALID [2018-11-18 22:58:04,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret8 := main(); {5288#true} is VALID [2018-11-18 22:58:04,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5290#(= main_~j~0 0)} is VALID [2018-11-18 22:58:04,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {5290#(= main_~j~0 0)} assume true; {5290#(= main_~j~0 0)} is VALID [2018-11-18 22:58:04,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {5290#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5291#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:04,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {5291#(<= main_~j~0 1)} assume true; {5291#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:04,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5292#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:04,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {5292#(<= main_~j~0 2)} assume true; {5292#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:04,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {5292#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5293#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:04,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {5293#(<= main_~j~0 3)} assume true; {5293#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:04,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {5293#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5294#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:04,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {5294#(<= main_~j~0 4)} assume true; {5294#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:04,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {5294#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5295#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:04,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {5295#(<= main_~j~0 5)} assume true; {5295#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:04,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {5295#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5296#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:04,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {5296#(<= main_~j~0 6)} assume true; {5296#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:04,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {5296#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5297#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:04,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {5297#(<= main_~j~0 7)} assume true; {5297#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:04,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {5297#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5298#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:04,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {5298#(<= main_~j~0 8)} assume true; {5298#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:04,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {5298#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5299#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:04,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {5299#(<= main_~j~0 9)} assume true; {5299#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:04,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {5299#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5300#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:04,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {5300#(<= main_~j~0 10)} assume true; {5300#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:04,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {5300#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5301#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:04,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {5301#(<= main_~j~0 11)} assume true; {5301#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:04,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {5301#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5302#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:04,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {5302#(<= main_~j~0 12)} assume true; {5302#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:04,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {5302#(<= main_~j~0 12)} assume !(~j~0 < 100000); {5289#false} is VALID [2018-11-18 22:58:04,535 INFO L273 TraceCheckUtils]: 32: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {5289#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} #t~short5 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5289#false} is VALID [2018-11-18 22:58:04,537 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5289#false} is VALID [2018-11-18 22:58:04,538 INFO L256 TraceCheckUtils]: 49: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5288#true} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {5288#true} ~cond := #in~cond; {5288#true} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {5288#true} assume !(0 == ~cond); {5288#true} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 52: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-18 22:58:04,538 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {5288#true} {5289#false} #79#return; {5289#false} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} #t~short5 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5289#false} is VALID [2018-11-18 22:58:04,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5289#false} is VALID [2018-11-18 22:58:04,539 INFO L256 TraceCheckUtils]: 59: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5289#false} is VALID [2018-11-18 22:58:04,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-18 22:58:04,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume 0 == ~cond; {5289#false} is VALID [2018-11-18 22:58:04,539 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-18 22:58:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 22:58:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:04,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:04,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:58:04,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:58:04,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:04,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:04,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {5288#true} call ULTIMATE.init(); {5288#true} is VALID [2018-11-18 22:58:04,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {5288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5288#true} is VALID [2018-11-18 22:58:04,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {5288#true} assume true; {5288#true} is VALID [2018-11-18 22:58:04,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5288#true} {5288#true} #75#return; {5288#true} is VALID [2018-11-18 22:58:04,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {5288#true} call #t~ret8 := main(); {5288#true} is VALID [2018-11-18 22:58:04,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {5288#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5321#(<= main_~j~0 0)} is VALID [2018-11-18 22:58:04,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {5321#(<= main_~j~0 0)} assume true; {5321#(<= main_~j~0 0)} is VALID [2018-11-18 22:58:04,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {5321#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5291#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:04,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {5291#(<= main_~j~0 1)} assume true; {5291#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:04,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {5291#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5292#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:04,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {5292#(<= main_~j~0 2)} assume true; {5292#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:04,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {5292#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5293#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:04,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {5293#(<= main_~j~0 3)} assume true; {5293#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:04,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {5293#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5294#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:04,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {5294#(<= main_~j~0 4)} assume true; {5294#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:04,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {5294#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5295#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:04,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {5295#(<= main_~j~0 5)} assume true; {5295#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:04,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {5295#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5296#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:04,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {5296#(<= main_~j~0 6)} assume true; {5296#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:04,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {5296#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5297#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:04,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {5297#(<= main_~j~0 7)} assume true; {5297#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:04,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {5297#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5298#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:04,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {5298#(<= main_~j~0 8)} assume true; {5298#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:04,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {5298#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5299#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:04,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {5299#(<= main_~j~0 9)} assume true; {5299#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:04,827 INFO L273 TraceCheckUtils]: 25: Hoare triple {5299#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5300#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:04,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {5300#(<= main_~j~0 10)} assume true; {5300#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:04,828 INFO L273 TraceCheckUtils]: 27: Hoare triple {5300#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5301#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:04,829 INFO L273 TraceCheckUtils]: 28: Hoare triple {5301#(<= main_~j~0 11)} assume true; {5301#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:04,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {5301#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5302#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:04,830 INFO L273 TraceCheckUtils]: 30: Hoare triple {5302#(<= main_~j~0 12)} assume true; {5302#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:04,831 INFO L273 TraceCheckUtils]: 31: Hoare triple {5302#(<= main_~j~0 12)} assume !(~j~0 < 100000); {5289#false} is VALID [2018-11-18 22:58:04,831 INFO L273 TraceCheckUtils]: 32: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {5289#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {5289#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,832 INFO L273 TraceCheckUtils]: 40: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 41: Hoare triple {5289#false} #t~short2 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 42: Hoare triple {5289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 43: Hoare triple {5289#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#false} ~i~0 := 0; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#false} #t~short5 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {5289#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L256 TraceCheckUtils]: 49: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L273 TraceCheckUtils]: 50: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L273 TraceCheckUtils]: 51: Hoare triple {5289#false} assume !(0 == ~cond); {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L273 TraceCheckUtils]: 52: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,834 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {5289#false} {5289#false} #79#return; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {5289#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 55: Hoare triple {5289#false} assume true; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 56: Hoare triple {5289#false} #t~short5 := ~i~0 < 100000; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {5289#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 58: Hoare triple {5289#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L256 TraceCheckUtils]: 59: Hoare triple {5289#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#false} ~cond := #in~cond; {5289#false} is VALID [2018-11-18 22:58:04,835 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#false} assume 0 == ~cond; {5289#false} is VALID [2018-11-18 22:58:04,836 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#false} assume !false; {5289#false} is VALID [2018-11-18 22:58:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:58:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:04,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:58:04,856 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:58:04,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:04,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:58:04,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:04,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:58:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:58:04,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:58:04,910 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 16 states. [2018-11-18 22:58:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:05,579 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-18 22:58:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:58:05,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:58:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:58:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-11-18 22:58:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:58:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-11-18 22:58:05,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2018-11-18 22:58:06,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:06,027 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:58:06,027 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 22:58:06,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:58:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 22:58:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-18 22:58:06,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:06,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-18 22:58:06,179 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-18 22:58:06,179 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-18 22:58:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:06,181 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-18 22:58:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:58:06,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:06,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:06,182 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-18 22:58:06,182 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-18 22:58:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:06,183 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-18 22:58:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:58:06,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:06,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:06,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:06,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:58:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-18 22:58:06,186 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 63 [2018-11-18 22:58:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:06,186 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-18 22:58:06,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:58:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:58:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 22:58:06,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:06,188 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:06,188 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:06,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 744717410, now seen corresponding path program 5 times [2018-11-18 22:58:06,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:06,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:06,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {5852#true} call ULTIMATE.init(); {5852#true} is VALID [2018-11-18 22:58:06,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {5852#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5852#true} is VALID [2018-11-18 22:58:06,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {5852#true} assume true; {5852#true} is VALID [2018-11-18 22:58:06,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5852#true} {5852#true} #75#return; {5852#true} is VALID [2018-11-18 22:58:06,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {5852#true} call #t~ret8 := main(); {5852#true} is VALID [2018-11-18 22:58:06,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {5852#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5854#(= main_~j~0 0)} is VALID [2018-11-18 22:58:06,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {5854#(= main_~j~0 0)} assume true; {5854#(= main_~j~0 0)} is VALID [2018-11-18 22:58:06,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {5854#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5855#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:06,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {5855#(<= main_~j~0 1)} assume true; {5855#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:06,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {5855#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5856#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:06,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {5856#(<= main_~j~0 2)} assume true; {5856#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:06,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {5856#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5857#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:06,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {5857#(<= main_~j~0 3)} assume true; {5857#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:06,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {5857#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5858#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:06,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {5858#(<= main_~j~0 4)} assume true; {5858#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:06,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {5858#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5859#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:06,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {5859#(<= main_~j~0 5)} assume true; {5859#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:06,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {5859#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5860#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:06,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {5860#(<= main_~j~0 6)} assume true; {5860#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:06,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {5860#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5861#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:06,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {5861#(<= main_~j~0 7)} assume true; {5861#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:06,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {5861#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5862#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:06,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {5862#(<= main_~j~0 8)} assume true; {5862#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:06,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {5862#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5863#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:06,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {5863#(<= main_~j~0 9)} assume true; {5863#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:06,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {5863#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5864#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:06,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {5864#(<= main_~j~0 10)} assume true; {5864#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:06,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {5864#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5865#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:06,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~j~0 11)} assume true; {5865#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:06,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5866#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:06,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~j~0 12)} assume true; {5866#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:06,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5867#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:06,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {5867#(<= main_~j~0 13)} assume true; {5867#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:06,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {5867#(<= main_~j~0 13)} assume !(~j~0 < 100000); {5853#false} is VALID [2018-11-18 22:58:06,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:06,835 INFO L273 TraceCheckUtils]: 35: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:06,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:06,836 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:06,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:06,837 INFO L273 TraceCheckUtils]: 39: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:06,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:06,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {5853#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:06,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:06,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:06,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:06,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {5853#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {5853#false} is VALID [2018-11-18 22:58:06,838 INFO L273 TraceCheckUtils]: 46: Hoare triple {5853#false} ~i~0 := 0; {5853#false} is VALID [2018-11-18 22:58:06,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:06,839 INFO L273 TraceCheckUtils]: 48: Hoare triple {5853#false} #t~short5 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:06,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {5853#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5853#false} is VALID [2018-11-18 22:58:06,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {5853#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5853#false} is VALID [2018-11-18 22:58:06,840 INFO L256 TraceCheckUtils]: 51: Hoare triple {5853#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5852#true} is VALID [2018-11-18 22:58:06,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {5852#true} ~cond := #in~cond; {5852#true} is VALID [2018-11-18 22:58:06,840 INFO L273 TraceCheckUtils]: 53: Hoare triple {5852#true} assume !(0 == ~cond); {5852#true} is VALID [2018-11-18 22:58:06,840 INFO L273 TraceCheckUtils]: 54: Hoare triple {5852#true} assume true; {5852#true} is VALID [2018-11-18 22:58:06,840 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {5852#true} {5853#false} #79#return; {5853#false} is VALID [2018-11-18 22:58:06,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {5853#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 57: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 58: Hoare triple {5853#false} #t~short5 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 59: Hoare triple {5853#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 60: Hoare triple {5853#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L256 TraceCheckUtils]: 61: Hoare triple {5853#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {5853#false} ~cond := #in~cond; {5853#false} is VALID [2018-11-18 22:58:06,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {5853#false} assume 0 == ~cond; {5853#false} is VALID [2018-11-18 22:58:06,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {5853#false} assume !false; {5853#false} is VALID [2018-11-18 22:58:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 22:58:06,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:06,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:06,855 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:58:06,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-18 22:58:06,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:07,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:07,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {5852#true} call ULTIMATE.init(); {5852#true} is VALID [2018-11-18 22:58:07,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {5852#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5852#true} is VALID [2018-11-18 22:58:07,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {5852#true} assume true; {5852#true} is VALID [2018-11-18 22:58:07,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5852#true} {5852#true} #75#return; {5852#true} is VALID [2018-11-18 22:58:07,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {5852#true} call #t~ret8 := main(); {5852#true} is VALID [2018-11-18 22:58:07,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {5852#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5886#(<= main_~j~0 0)} is VALID [2018-11-18 22:58:07,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {5886#(<= main_~j~0 0)} assume true; {5886#(<= main_~j~0 0)} is VALID [2018-11-18 22:58:07,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {5886#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5855#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:07,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {5855#(<= main_~j~0 1)} assume true; {5855#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:07,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {5855#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5856#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:07,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {5856#(<= main_~j~0 2)} assume true; {5856#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:07,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {5856#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5857#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:07,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {5857#(<= main_~j~0 3)} assume true; {5857#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:07,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {5857#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5858#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:07,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {5858#(<= main_~j~0 4)} assume true; {5858#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:07,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {5858#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5859#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:07,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {5859#(<= main_~j~0 5)} assume true; {5859#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:07,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {5859#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5860#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:07,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {5860#(<= main_~j~0 6)} assume true; {5860#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:07,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {5860#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5861#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:07,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {5861#(<= main_~j~0 7)} assume true; {5861#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:07,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {5861#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5862#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:07,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {5862#(<= main_~j~0 8)} assume true; {5862#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:07,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {5862#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5863#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:07,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {5863#(<= main_~j~0 9)} assume true; {5863#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:07,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {5863#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5864#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:07,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {5864#(<= main_~j~0 10)} assume true; {5864#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:07,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {5864#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5865#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:07,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~j~0 11)} assume true; {5865#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:07,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5866#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:07,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~j~0 12)} assume true; {5866#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:07,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5867#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:07,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {5867#(<= main_~j~0 13)} assume true; {5867#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {5867#(<= main_~j~0 13)} assume !(~j~0 < 100000); {5853#false} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:07,568 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 39: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 40: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:07,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {5853#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 42: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 43: Hoare triple {5853#false} #t~short2 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 44: Hoare triple {5853#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {5853#false} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {5853#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {5853#false} is VALID [2018-11-18 22:58:07,570 INFO L273 TraceCheckUtils]: 46: Hoare triple {5853#false} ~i~0 := 0; {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {5853#false} #t~short5 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 49: Hoare triple {5853#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {5853#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L256 TraceCheckUtils]: 51: Hoare triple {5853#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5853#false} is VALID [2018-11-18 22:58:07,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {5853#false} ~cond := #in~cond; {5853#false} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {5853#false} assume !(0 == ~cond); {5853#false} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,572 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {5853#false} {5853#false} #79#return; {5853#false} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {5853#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {5853#false} is VALID [2018-11-18 22:58:07,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {5853#false} assume true; {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {5853#false} #t~short5 := ~i~0 < 100000; {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {5853#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {5853#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L256 TraceCheckUtils]: 61: Hoare triple {5853#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {5853#false} ~cond := #in~cond; {5853#false} is VALID [2018-11-18 22:58:07,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {5853#false} assume 0 == ~cond; {5853#false} is VALID [2018-11-18 22:58:07,574 INFO L273 TraceCheckUtils]: 64: Hoare triple {5853#false} assume !false; {5853#false} is VALID [2018-11-18 22:58:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 22:58:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:58:07,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-11-18 22:58:07,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:07,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:58:07,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:07,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:58:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:58:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:58:07,854 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2018-11-18 22:58:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:08,248 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-11-18 22:58:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:58:08,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-11-18 22:58:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:58:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-18 22:58:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:58:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-18 22:58:08,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2018-11-18 22:58:08,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:08,324 INFO L225 Difference]: With dead ends: 104 [2018-11-18 22:58:08,324 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 22:58:08,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:58:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 22:58:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-18 22:58:08,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:08,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-18 22:58:08,391 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-18 22:58:08,391 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-18 22:58:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:08,393 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-18 22:58:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-18 22:58:08,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:08,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:08,394 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-18 22:58:08,394 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-18 22:58:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:08,396 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-18 22:58:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-18 22:58:08,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:08,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:08,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:08,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 22:58:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-18 22:58:08,398 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 65 [2018-11-18 22:58:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:08,399 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-18 22:58:08,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:58:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-18 22:58:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 22:58:08,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:08,400 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:08,400 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:08,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 12110332, now seen corresponding path program 6 times [2018-11-18 22:58:08,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:08,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:08,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:08,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {6433#true} call ULTIMATE.init(); {6433#true} is VALID [2018-11-18 22:58:08,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {6433#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6433#true} is VALID [2018-11-18 22:58:08,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {6433#true} assume true; {6433#true} is VALID [2018-11-18 22:58:08,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6433#true} {6433#true} #75#return; {6433#true} is VALID [2018-11-18 22:58:08,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {6433#true} call #t~ret8 := main(); {6433#true} is VALID [2018-11-18 22:58:08,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {6433#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6435#(= main_~j~0 0)} is VALID [2018-11-18 22:58:08,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {6435#(= main_~j~0 0)} assume true; {6435#(= main_~j~0 0)} is VALID [2018-11-18 22:58:08,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {6435#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6436#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:08,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {6436#(<= main_~j~0 1)} assume true; {6436#(<= main_~j~0 1)} is VALID [2018-11-18 22:58:08,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {6436#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6437#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:08,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {6437#(<= main_~j~0 2)} assume true; {6437#(<= main_~j~0 2)} is VALID [2018-11-18 22:58:08,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {6437#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6438#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:08,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {6438#(<= main_~j~0 3)} assume true; {6438#(<= main_~j~0 3)} is VALID [2018-11-18 22:58:08,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {6438#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6439#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:08,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {6439#(<= main_~j~0 4)} assume true; {6439#(<= main_~j~0 4)} is VALID [2018-11-18 22:58:08,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {6439#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6440#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:08,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {6440#(<= main_~j~0 5)} assume true; {6440#(<= main_~j~0 5)} is VALID [2018-11-18 22:58:08,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {6440#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6441#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:08,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {6441#(<= main_~j~0 6)} assume true; {6441#(<= main_~j~0 6)} is VALID [2018-11-18 22:58:08,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {6441#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6442#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:08,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {6442#(<= main_~j~0 7)} assume true; {6442#(<= main_~j~0 7)} is VALID [2018-11-18 22:58:08,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {6442#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6443#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:08,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {6443#(<= main_~j~0 8)} assume true; {6443#(<= main_~j~0 8)} is VALID [2018-11-18 22:58:08,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {6443#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6444#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:08,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {6444#(<= main_~j~0 9)} assume true; {6444#(<= main_~j~0 9)} is VALID [2018-11-18 22:58:08,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {6444#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6445#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:08,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {6445#(<= main_~j~0 10)} assume true; {6445#(<= main_~j~0 10)} is VALID [2018-11-18 22:58:08,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {6445#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6446#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:08,978 INFO L273 TraceCheckUtils]: 28: Hoare triple {6446#(<= main_~j~0 11)} assume true; {6446#(<= main_~j~0 11)} is VALID [2018-11-18 22:58:08,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {6446#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6447#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:08,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {6447#(<= main_~j~0 12)} assume true; {6447#(<= main_~j~0 12)} is VALID [2018-11-18 22:58:08,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {6447#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6448#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:08,981 INFO L273 TraceCheckUtils]: 32: Hoare triple {6448#(<= main_~j~0 13)} assume true; {6448#(<= main_~j~0 13)} is VALID [2018-11-18 22:58:08,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {6448#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6449#(<= main_~j~0 14)} is VALID [2018-11-18 22:58:08,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {6449#(<= main_~j~0 14)} assume true; {6449#(<= main_~j~0 14)} is VALID [2018-11-18 22:58:08,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {6449#(<= main_~j~0 14)} assume !(~j~0 < 100000); {6434#false} is VALID [2018-11-18 22:58:08,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {6434#false} assume true; {6434#false} is VALID [2018-11-18 22:58:08,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {6434#false} #t~short2 := ~i~0 < 100000; {6434#false} is VALID [2018-11-18 22:58:08,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {6434#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6434#false} is VALID [2018-11-18 22:58:08,984 INFO L273 TraceCheckUtils]: 39: Hoare triple {6434#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {6434#false} is VALID [2018-11-18 22:58:08,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {6434#false} assume true; {6434#false} is VALID [2018-11-18 22:58:08,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {6434#false} #t~short2 := ~i~0 < 100000; {6434#false} is VALID [2018-11-18 22:58:08,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {6434#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6434#false} is VALID [2018-11-18 22:58:08,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {6434#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {6434#false} is VALID [2018-11-18 22:58:08,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {6434#false} assume true; {6434#false} is VALID [2018-11-18 22:58:08,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {6434#false} #t~short2 := ~i~0 < 100000; {6434#false} is VALID [2018-11-18 22:58:08,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {6434#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6434#false} is VALID [2018-11-18 22:58:08,986 INFO L273 TraceCheckUtils]: 47: Hoare triple {6434#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {6434#false} is VALID [2018-11-18 22:58:08,986 INFO L273 TraceCheckUtils]: 48: Hoare triple {6434#false} ~i~0 := 0; {6434#false} is VALID [2018-11-18 22:58:08,987 INFO L273 TraceCheckUtils]: 49: Hoare triple {6434#false} assume true; {6434#false} is VALID [2018-11-18 22:58:08,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {6434#false} #t~short5 := ~i~0 < 100000; {6434#false} is VALID [2018-11-18 22:58:08,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {6434#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6434#false} is VALID [2018-11-18 22:58:08,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {6434#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {6434#false} is VALID [2018-11-18 22:58:08,987 INFO L256 TraceCheckUtils]: 53: Hoare triple {6434#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6433#true} is VALID [2018-11-18 22:58:08,987 INFO L273 TraceCheckUtils]: 54: Hoare triple {6433#true} ~cond := #in~cond; {6433#true} is VALID [2018-11-18 22:58:08,988 INFO L273 TraceCheckUtils]: 55: Hoare triple {6433#true} assume !(0 == ~cond); {6433#true} is VALID [2018-11-18 22:58:08,988 INFO L273 TraceCheckUtils]: 56: Hoare triple {6433#true} assume true; {6433#true} is VALID [2018-11-18 22:58:08,988 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {6433#true} {6434#false} #79#return; {6434#false} is VALID [2018-11-18 22:58:08,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {6434#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {6434#false} is VALID [2018-11-18 22:58:08,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {6434#false} assume true; {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {6434#false} #t~short5 := ~i~0 < 100000; {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {6434#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {6434#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L256 TraceCheckUtils]: 63: Hoare triple {6434#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L273 TraceCheckUtils]: 64: Hoare triple {6434#false} ~cond := #in~cond; {6434#false} is VALID [2018-11-18 22:58:08,989 INFO L273 TraceCheckUtils]: 65: Hoare triple {6434#false} assume 0 == ~cond; {6434#false} is VALID [2018-11-18 22:58:08,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {6434#false} assume !false; {6434#false} is VALID [2018-11-18 22:58:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 22:58:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:08,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:58:09,049 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-18 22:58:09,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:09,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:09,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 22:58:09,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:58:09,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:58:09,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 22:58:09,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-18 22:58:09,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:58:09,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:58:09,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:58:09,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:58:09,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-18 22:58:11,358 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))) is different from true [2018-11-18 22:58:13,403 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:58:15,437 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:58:15,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-18 22:58:15,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-18 22:58:15,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:58:15,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:58:15,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:58:15,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:58:15,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:58:15,648 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-11-18 22:58:15,650 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:58:17,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {6433#true} call ULTIMATE.init(); {6433#true} is VALID [2018-11-18 22:58:17,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {6433#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6433#true} is VALID [2018-11-18 22:58:17,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {6433#true} assume true; {6433#true} is VALID [2018-11-18 22:58:17,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6433#true} {6433#true} #75#return; {6433#true} is VALID [2018-11-18 22:58:17,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {6433#true} call #t~ret8 := main(); {6433#true} is VALID [2018-11-18 22:58:17,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {6433#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !(~j~0 < 100000); {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {6468#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume true; {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} #t~short2 := ~i~0 < 100000; {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,788 INFO L273 TraceCheckUtils]: 42: Hoare triple {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,789 INFO L273 TraceCheckUtils]: 43: Hoare triple {6571#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 22:58:17,790 INFO L273 TraceCheckUtils]: 44: Hoare triple {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume true; {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 22:58:17,791 INFO L273 TraceCheckUtils]: 45: Hoare triple {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} #t~short2 := ~i~0 < 100000; {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 22:58:17,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 22:58:17,793 INFO L273 TraceCheckUtils]: 47: Hoare triple {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 22:58:17,794 INFO L273 TraceCheckUtils]: 48: Hoare triple {6584#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} ~i~0 := 0; {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,794 INFO L273 TraceCheckUtils]: 49: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,799 INFO L256 TraceCheckUtils]: 53: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6616#(exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|))))} is VALID [2018-11-18 22:58:17,800 INFO L273 TraceCheckUtils]: 54: Hoare triple {6616#(exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|))))} ~cond := #in~cond; {6620#(and (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:58:17,801 INFO L273 TraceCheckUtils]: 55: Hoare triple {6620#(and (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {6624#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))))} is VALID [2018-11-18 22:58:17,802 INFO L273 TraceCheckUtils]: 56: Hoare triple {6624#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))))} assume true; {6624#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))))} is VALID [2018-11-18 22:58:17,803 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {6624#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_1| 4))) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))))} {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} #79#return; {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 22:58:17,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {6600#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,805 INFO L273 TraceCheckUtils]: 59: Hoare triple {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume true; {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,805 INFO L273 TraceCheckUtils]: 60: Hoare triple {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} #t~short5 := ~i~0 < 100000; {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,806 INFO L273 TraceCheckUtils]: 61: Hoare triple {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 22:58:17,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {6634#(and (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 4)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 4))) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {6647#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-18 22:58:17,808 INFO L256 TraceCheckUtils]: 63: Hoare triple {6647#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6651#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 22:58:17,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {6651#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6655#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:58:17,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {6655#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6434#false} is VALID [2018-11-18 22:58:17,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {6434#false} assume !false; {6434#false} is VALID [2018-11-18 22:58:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 210 trivial. 1 not checked. [2018-11-18 22:58:17,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:17,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-18 22:58:17,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-11-18 22:58:17,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:17,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:58:17,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:17,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:58:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:58:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=542, Unknown=2, NotChecked=50, Total=756 [2018-11-18 22:58:17,949 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 28 states. [2018-11-18 22:59:54,341 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 23:00:01,019 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-11-18 23:00:05,140 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-18 23:00:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:19,592 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-11-18 23:00:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 23:00:19,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-11-18 23:00:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:00:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 107 transitions. [2018-11-18 23:00:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:00:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 107 transitions. [2018-11-18 23:00:19,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 107 transitions. [2018-11-18 23:00:20,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:20,101 INFO L225 Difference]: With dead ends: 117 [2018-11-18 23:00:20,101 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 23:00:20,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=460, Invalid=1703, Unknown=3, NotChecked=90, Total=2256 [2018-11-18 23:00:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 23:00:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-18 23:00:20,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:20,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-18 23:00:20,227 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-18 23:00:20,228 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-18 23:00:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:20,231 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-18 23:00:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-18 23:00:20,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:20,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:20,231 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-18 23:00:20,232 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-18 23:00:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:20,233 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-18 23:00:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-18 23:00:20,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:20,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:20,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:20,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 23:00:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-18 23:00:20,236 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 67 [2018-11-18 23:00:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:20,236 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-18 23:00:20,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 23:00:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-18 23:00:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 23:00:20,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:20,238 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:20,238 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:20,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1736856925, now seen corresponding path program 7 times [2018-11-18 23:00:20,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:20,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:20,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:20,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:20,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {7130#true} call ULTIMATE.init(); {7130#true} is VALID [2018-11-18 23:00:20,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {7130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7130#true} is VALID [2018-11-18 23:00:20,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {7130#true} assume true; {7130#true} is VALID [2018-11-18 23:00:20,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7130#true} {7130#true} #75#return; {7130#true} is VALID [2018-11-18 23:00:20,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {7130#true} call #t~ret8 := main(); {7130#true} is VALID [2018-11-18 23:00:20,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {7130#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7132#(= main_~j~0 0)} is VALID [2018-11-18 23:00:20,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {7132#(= main_~j~0 0)} assume true; {7132#(= main_~j~0 0)} is VALID [2018-11-18 23:00:20,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {7132#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7133#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:20,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {7133#(<= main_~j~0 1)} assume true; {7133#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:20,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {7133#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7134#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:20,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {7134#(<= main_~j~0 2)} assume true; {7134#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:20,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {7134#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7135#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:20,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {7135#(<= main_~j~0 3)} assume true; {7135#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:20,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {7135#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7136#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:20,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {7136#(<= main_~j~0 4)} assume true; {7136#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:20,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {7136#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7137#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:20,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {7137#(<= main_~j~0 5)} assume true; {7137#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:20,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {7137#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7138#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:20,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {7138#(<= main_~j~0 6)} assume true; {7138#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:20,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {7138#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7139#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:20,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {7139#(<= main_~j~0 7)} assume true; {7139#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:20,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {7139#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7140#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:20,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {7140#(<= main_~j~0 8)} assume true; {7140#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:20,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {7140#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7141#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:20,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {7141#(<= main_~j~0 9)} assume true; {7141#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:20,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {7141#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7142#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:20,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {7142#(<= main_~j~0 10)} assume true; {7142#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:20,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {7142#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7143#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:20,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {7143#(<= main_~j~0 11)} assume true; {7143#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:20,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {7143#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7144#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:20,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {7144#(<= main_~j~0 12)} assume true; {7144#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:20,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {7144#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7145#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:20,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {7145#(<= main_~j~0 13)} assume true; {7145#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:20,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {7145#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7146#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:20,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {7146#(<= main_~j~0 14)} assume true; {7146#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:20,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {7146#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7147#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:20,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {7147#(<= main_~j~0 15)} assume true; {7147#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:20,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {7147#(<= main_~j~0 15)} assume !(~j~0 < 100000); {7131#false} is VALID [2018-11-18 23:00:20,674 INFO L273 TraceCheckUtils]: 38: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,674 INFO L273 TraceCheckUtils]: 39: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {7131#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {7131#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {7131#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {7131#false} is VALID [2018-11-18 23:00:20,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {7131#false} ~i~0 := 0; {7131#false} is VALID [2018-11-18 23:00:20,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,677 INFO L273 TraceCheckUtils]: 53: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,677 INFO L256 TraceCheckUtils]: 55: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7130#true} is VALID [2018-11-18 23:00:20,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {7130#true} ~cond := #in~cond; {7130#true} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 57: Hoare triple {7130#true} assume !(0 == ~cond); {7130#true} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 58: Hoare triple {7130#true} assume true; {7130#true} is VALID [2018-11-18 23:00:20,678 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {7130#true} {7131#false} #79#return; {7131#false} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 60: Hoare triple {7131#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,679 INFO L256 TraceCheckUtils]: 65: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7130#true} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {7130#true} ~cond := #in~cond; {7130#true} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {7130#true} assume !(0 == ~cond); {7130#true} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {7130#true} assume true; {7130#true} is VALID [2018-11-18 23:00:20,679 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7130#true} {7131#false} #79#return; {7131#false} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 70: Hoare triple {7131#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 71: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,679 INFO L273 TraceCheckUtils]: 72: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L273 TraceCheckUtils]: 73: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L273 TraceCheckUtils]: 74: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L256 TraceCheckUtils]: 75: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L273 TraceCheckUtils]: 76: Hoare triple {7131#false} ~cond := #in~cond; {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L273 TraceCheckUtils]: 77: Hoare triple {7131#false} assume 0 == ~cond; {7131#false} is VALID [2018-11-18 23:00:20,680 INFO L273 TraceCheckUtils]: 78: Hoare triple {7131#false} assume !false; {7131#false} is VALID [2018-11-18 23:00:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 4 proven. 240 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 23:00:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:20,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:00:20,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:00:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:20,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:20,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {7130#true} call ULTIMATE.init(); {7130#true} is VALID [2018-11-18 23:00:20,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {7130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7130#true} is VALID [2018-11-18 23:00:20,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {7130#true} assume true; {7130#true} is VALID [2018-11-18 23:00:20,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7130#true} {7130#true} #75#return; {7130#true} is VALID [2018-11-18 23:00:20,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {7130#true} call #t~ret8 := main(); {7130#true} is VALID [2018-11-18 23:00:20,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {7130#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7166#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:20,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {7166#(<= main_~j~0 0)} assume true; {7166#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:20,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {7166#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7133#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:20,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {7133#(<= main_~j~0 1)} assume true; {7133#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:20,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {7133#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7134#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:20,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {7134#(<= main_~j~0 2)} assume true; {7134#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:20,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {7134#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7135#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:20,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {7135#(<= main_~j~0 3)} assume true; {7135#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:20,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {7135#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7136#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:20,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {7136#(<= main_~j~0 4)} assume true; {7136#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:20,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {7136#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7137#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:20,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {7137#(<= main_~j~0 5)} assume true; {7137#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:20,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {7137#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7138#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:20,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {7138#(<= main_~j~0 6)} assume true; {7138#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:20,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {7138#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7139#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:20,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {7139#(<= main_~j~0 7)} assume true; {7139#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:20,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {7139#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7140#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:20,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {7140#(<= main_~j~0 8)} assume true; {7140#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:20,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {7140#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7141#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:20,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {7141#(<= main_~j~0 9)} assume true; {7141#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:20,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {7141#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7142#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:20,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {7142#(<= main_~j~0 10)} assume true; {7142#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:20,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {7142#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7143#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:20,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {7143#(<= main_~j~0 11)} assume true; {7143#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:20,923 INFO L273 TraceCheckUtils]: 29: Hoare triple {7143#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7144#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:20,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {7144#(<= main_~j~0 12)} assume true; {7144#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:20,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {7144#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7145#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:20,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {7145#(<= main_~j~0 13)} assume true; {7145#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:20,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {7145#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7146#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:20,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {7146#(<= main_~j~0 14)} assume true; {7146#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:20,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {7146#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7147#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:20,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {7147#(<= main_~j~0 15)} assume true; {7147#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:20,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {7147#(<= main_~j~0 15)} assume !(~j~0 < 100000); {7131#false} is VALID [2018-11-18 23:00:20,929 INFO L273 TraceCheckUtils]: 38: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,929 INFO L273 TraceCheckUtils]: 39: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {7131#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {7131#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {7131#false} #t~short2 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,931 INFO L273 TraceCheckUtils]: 48: Hoare triple {7131#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7131#false} is VALID [2018-11-18 23:00:20,931 INFO L273 TraceCheckUtils]: 49: Hoare triple {7131#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {7131#false} is VALID [2018-11-18 23:00:20,932 INFO L273 TraceCheckUtils]: 50: Hoare triple {7131#false} ~i~0 := 0; {7131#false} is VALID [2018-11-18 23:00:20,932 INFO L273 TraceCheckUtils]: 51: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,932 INFO L273 TraceCheckUtils]: 52: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,932 INFO L273 TraceCheckUtils]: 53: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,932 INFO L273 TraceCheckUtils]: 54: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L256 TraceCheckUtils]: 55: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {7131#false} ~cond := #in~cond; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {7131#false} assume !(0 == ~cond); {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {7131#false} {7131#false} #79#return; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {7131#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 61: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 62: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,933 INFO L273 TraceCheckUtils]: 63: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L256 TraceCheckUtils]: 65: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 66: Hoare triple {7131#false} ~cond := #in~cond; {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 67: Hoare triple {7131#false} assume !(0 == ~cond); {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 68: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7131#false} {7131#false} #79#return; {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 70: Hoare triple {7131#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7131#false} is VALID [2018-11-18 23:00:20,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {7131#false} assume true; {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 72: Hoare triple {7131#false} #t~short5 := ~i~0 < 100000; {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 73: Hoare triple {7131#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 74: Hoare triple {7131#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L256 TraceCheckUtils]: 75: Hoare triple {7131#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 76: Hoare triple {7131#false} ~cond := #in~cond; {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 77: Hoare triple {7131#false} assume 0 == ~cond; {7131#false} is VALID [2018-11-18 23:00:20,935 INFO L273 TraceCheckUtils]: 78: Hoare triple {7131#false} assume !false; {7131#false} is VALID [2018-11-18 23:00:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 23:00:20,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:20,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 23:00:20,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-11-18 23:00:20,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:20,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:00:21,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:21,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:00:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:00:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:00:21,019 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 19 states. [2018-11-18 23:00:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:21,436 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-18 23:00:21,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 23:00:21,436 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-11-18 23:00:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:00:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-18 23:00:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:00:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-18 23:00:21,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2018-11-18 23:00:21,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:21,684 INFO L225 Difference]: With dead ends: 128 [2018-11-18 23:00:21,684 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 23:00:21,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:00:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 23:00:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 23:00:21,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:21,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-18 23:00:21,896 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-18 23:00:21,896 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-18 23:00:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:21,899 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-18 23:00:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-18 23:00:21,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:21,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:21,899 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-18 23:00:21,900 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-18 23:00:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:21,901 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-18 23:00:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-18 23:00:21,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:21,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:21,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:21,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 23:00:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-11-18 23:00:21,904 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 79 [2018-11-18 23:00:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:21,904 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-11-18 23:00:21,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 23:00:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-18 23:00:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 23:00:21,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:21,906 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:21,906 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:21,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1878078089, now seen corresponding path program 8 times [2018-11-18 23:00:21,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:00:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:22,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {7834#true} call ULTIMATE.init(); {7834#true} is VALID [2018-11-18 23:00:22,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {7834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7834#true} is VALID [2018-11-18 23:00:22,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {7834#true} assume true; {7834#true} is VALID [2018-11-18 23:00:22,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7834#true} {7834#true} #75#return; {7834#true} is VALID [2018-11-18 23:00:22,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {7834#true} call #t~ret8 := main(); {7834#true} is VALID [2018-11-18 23:00:22,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {7834#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7836#(= main_~j~0 0)} is VALID [2018-11-18 23:00:22,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {7836#(= main_~j~0 0)} assume true; {7836#(= main_~j~0 0)} is VALID [2018-11-18 23:00:22,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {7836#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7837#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:22,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {7837#(<= main_~j~0 1)} assume true; {7837#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:22,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {7837#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7838#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:22,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {7838#(<= main_~j~0 2)} assume true; {7838#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:22,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {7838#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7839#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:22,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {7839#(<= main_~j~0 3)} assume true; {7839#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:22,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {7839#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7840#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:22,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {7840#(<= main_~j~0 4)} assume true; {7840#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:22,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {7840#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7841#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:22,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {7841#(<= main_~j~0 5)} assume true; {7841#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:22,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {7841#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7842#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:22,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {7842#(<= main_~j~0 6)} assume true; {7842#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:22,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {7842#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7843#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:22,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {7843#(<= main_~j~0 7)} assume true; {7843#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:22,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {7843#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7844#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:22,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {7844#(<= main_~j~0 8)} assume true; {7844#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:22,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {7844#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7845#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:22,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {7845#(<= main_~j~0 9)} assume true; {7845#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:22,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {7845#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7846#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:22,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {7846#(<= main_~j~0 10)} assume true; {7846#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:22,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {7846#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7847#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:22,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {7847#(<= main_~j~0 11)} assume true; {7847#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:22,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {7847#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7848#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:22,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {7848#(<= main_~j~0 12)} assume true; {7848#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:22,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {7848#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7849#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:22,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {7849#(<= main_~j~0 13)} assume true; {7849#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:22,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {7849#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7850#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:22,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {7850#(<= main_~j~0 14)} assume true; {7850#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:22,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {7850#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7851#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:22,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {7851#(<= main_~j~0 15)} assume true; {7851#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:22,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {7851#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7852#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:22,262 INFO L273 TraceCheckUtils]: 38: Hoare triple {7852#(<= main_~j~0 16)} assume true; {7852#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:22,263 INFO L273 TraceCheckUtils]: 39: Hoare triple {7852#(<= main_~j~0 16)} assume !(~j~0 < 100000); {7835#false} is VALID [2018-11-18 23:00:22,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {7835#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {7835#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,265 INFO L273 TraceCheckUtils]: 51: Hoare triple {7835#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {7835#false} is VALID [2018-11-18 23:00:22,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {7835#false} ~i~0 := 0; {7835#false} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 56: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,266 INFO L256 TraceCheckUtils]: 57: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7834#true} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {7834#true} ~cond := #in~cond; {7834#true} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 59: Hoare triple {7834#true} assume !(0 == ~cond); {7834#true} is VALID [2018-11-18 23:00:22,266 INFO L273 TraceCheckUtils]: 60: Hoare triple {7834#true} assume true; {7834#true} is VALID [2018-11-18 23:00:22,267 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {7834#true} {7835#false} #79#return; {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {7835#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 65: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,267 INFO L256 TraceCheckUtils]: 67: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7834#true} is VALID [2018-11-18 23:00:22,267 INFO L273 TraceCheckUtils]: 68: Hoare triple {7834#true} ~cond := #in~cond; {7834#true} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 69: Hoare triple {7834#true} assume !(0 == ~cond); {7834#true} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {7834#true} assume true; {7834#true} is VALID [2018-11-18 23:00:22,268 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7834#true} {7835#false} #79#return; {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 72: Hoare triple {7835#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 75: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L273 TraceCheckUtils]: 76: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,268 INFO L256 TraceCheckUtils]: 77: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7835#false} is VALID [2018-11-18 23:00:22,269 INFO L273 TraceCheckUtils]: 78: Hoare triple {7835#false} ~cond := #in~cond; {7835#false} is VALID [2018-11-18 23:00:22,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {7835#false} assume 0 == ~cond; {7835#false} is VALID [2018-11-18 23:00:22,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {7835#false} assume !false; {7835#false} is VALID [2018-11-18 23:00:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 4 proven. 272 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 23:00:22,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:22,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:00:22,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:00:22,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:00:22,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:22,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:22,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {7834#true} call ULTIMATE.init(); {7834#true} is VALID [2018-11-18 23:00:22,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {7834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7834#true} is VALID [2018-11-18 23:00:22,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {7834#true} assume true; {7834#true} is VALID [2018-11-18 23:00:22,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7834#true} {7834#true} #75#return; {7834#true} is VALID [2018-11-18 23:00:22,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {7834#true} call #t~ret8 := main(); {7834#true} is VALID [2018-11-18 23:00:22,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {7834#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7871#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:22,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {7871#(<= main_~j~0 0)} assume true; {7871#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:22,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {7871#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7837#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:22,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {7837#(<= main_~j~0 1)} assume true; {7837#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:22,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {7837#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7838#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:22,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {7838#(<= main_~j~0 2)} assume true; {7838#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:22,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {7838#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7839#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:22,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {7839#(<= main_~j~0 3)} assume true; {7839#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:22,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {7839#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7840#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:22,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {7840#(<= main_~j~0 4)} assume true; {7840#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:22,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {7840#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7841#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:22,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {7841#(<= main_~j~0 5)} assume true; {7841#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:22,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {7841#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7842#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:22,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {7842#(<= main_~j~0 6)} assume true; {7842#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:22,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {7842#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7843#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:22,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {7843#(<= main_~j~0 7)} assume true; {7843#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:22,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {7843#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7844#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:22,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {7844#(<= main_~j~0 8)} assume true; {7844#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:22,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {7844#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7845#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:22,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {7845#(<= main_~j~0 9)} assume true; {7845#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:22,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {7845#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7846#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:22,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {7846#(<= main_~j~0 10)} assume true; {7846#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:22,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {7846#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7847#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:22,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {7847#(<= main_~j~0 11)} assume true; {7847#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:22,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {7847#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7848#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:22,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {7848#(<= main_~j~0 12)} assume true; {7848#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:22,513 INFO L273 TraceCheckUtils]: 31: Hoare triple {7848#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7849#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:22,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {7849#(<= main_~j~0 13)} assume true; {7849#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:22,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {7849#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7850#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:22,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {7850#(<= main_~j~0 14)} assume true; {7850#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:22,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {7850#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7851#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:22,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {7851#(<= main_~j~0 15)} assume true; {7851#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:22,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {7851#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7852#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:22,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {7852#(<= main_~j~0 16)} assume true; {7852#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:22,519 INFO L273 TraceCheckUtils]: 39: Hoare triple {7852#(<= main_~j~0 16)} assume !(~j~0 < 100000); {7835#false} is VALID [2018-11-18 23:00:22,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {7835#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,520 INFO L273 TraceCheckUtils]: 45: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,520 INFO L273 TraceCheckUtils]: 46: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {7835#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {7835#false} #t~short2 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {7835#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {7835#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {7835#false} ~i~0 := 0; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L256 TraceCheckUtils]: 57: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {7835#false} ~cond := #in~cond; {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 59: Hoare triple {7835#false} assume !(0 == ~cond); {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {7835#false} {7835#false} #79#return; {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 62: Hoare triple {7835#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,522 INFO L273 TraceCheckUtils]: 64: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 65: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 66: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L256 TraceCheckUtils]: 67: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {7835#false} ~cond := #in~cond; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 69: Hoare triple {7835#false} assume !(0 == ~cond); {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 70: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7835#false} {7835#false} #79#return; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {7835#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {7835#false} is VALID [2018-11-18 23:00:22,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {7835#false} assume true; {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 74: Hoare triple {7835#false} #t~short5 := ~i~0 < 100000; {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 75: Hoare triple {7835#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 76: Hoare triple {7835#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L256 TraceCheckUtils]: 77: Hoare triple {7835#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 78: Hoare triple {7835#false} ~cond := #in~cond; {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 79: Hoare triple {7835#false} assume 0 == ~cond; {7835#false} is VALID [2018-11-18 23:00:22,524 INFO L273 TraceCheckUtils]: 80: Hoare triple {7835#false} assume !false; {7835#false} is VALID [2018-11-18 23:00:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 23:00:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 23:00:22,548 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-11-18 23:00:22,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:22,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 23:00:22,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:22,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 23:00:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 23:00:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:00:22,619 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 20 states. [2018-11-18 23:00:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:23,036 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-18 23:00:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 23:00:23,036 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-11-18 23:00:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:00:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2018-11-18 23:00:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:00:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2018-11-18 23:00:23,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 82 transitions. [2018-11-18 23:00:23,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:23,119 INFO L225 Difference]: With dead ends: 130 [2018-11-18 23:00:23,119 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 23:00:23,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:00:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 23:00:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-18 23:00:23,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:23,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-18 23:00:23,229 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-18 23:00:23,229 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-18 23:00:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:23,232 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-18 23:00:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-18 23:00:23,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:23,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:23,233 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-18 23:00:23,233 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-18 23:00:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:23,235 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-18 23:00:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-18 23:00:23,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:23,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:23,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:23,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 23:00:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-18 23:00:23,237 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 81 [2018-11-18 23:00:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:23,237 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-18 23:00:23,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 23:00:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-18 23:00:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 23:00:23,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:23,239 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:23,239 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:23,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1202084079, now seen corresponding path program 9 times [2018-11-18 23:00:23,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:23,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:23,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8555#true} is VALID [2018-11-18 23:00:23,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {8555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8555#true} is VALID [2018-11-18 23:00:23,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2018-11-18 23:00:23,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #75#return; {8555#true} is VALID [2018-11-18 23:00:23,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret8 := main(); {8555#true} is VALID [2018-11-18 23:00:23,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {8555#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8557#(= main_~j~0 0)} is VALID [2018-11-18 23:00:23,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {8557#(= main_~j~0 0)} assume true; {8557#(= main_~j~0 0)} is VALID [2018-11-18 23:00:23,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {8557#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8558#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:23,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {8558#(<= main_~j~0 1)} assume true; {8558#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:23,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {8558#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8559#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:23,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {8559#(<= main_~j~0 2)} assume true; {8559#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:23,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {8559#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8560#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:23,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {8560#(<= main_~j~0 3)} assume true; {8560#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:23,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {8560#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8561#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:23,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {8561#(<= main_~j~0 4)} assume true; {8561#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:23,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {8561#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8562#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:23,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {8562#(<= main_~j~0 5)} assume true; {8562#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:23,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {8562#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8563#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:23,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {8563#(<= main_~j~0 6)} assume true; {8563#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:23,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {8563#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8564#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:23,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {8564#(<= main_~j~0 7)} assume true; {8564#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:23,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {8564#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8565#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:23,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {8565#(<= main_~j~0 8)} assume true; {8565#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:23,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {8565#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8566#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:23,678 INFO L273 TraceCheckUtils]: 24: Hoare triple {8566#(<= main_~j~0 9)} assume true; {8566#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:23,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {8566#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8567#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:23,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {8567#(<= main_~j~0 10)} assume true; {8567#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:23,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {8567#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8568#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:23,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {8568#(<= main_~j~0 11)} assume true; {8568#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:23,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {8568#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8569#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:23,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {8569#(<= main_~j~0 12)} assume true; {8569#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:23,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {8569#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8570#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:23,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {8570#(<= main_~j~0 13)} assume true; {8570#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:23,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {8570#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8571#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:23,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {8571#(<= main_~j~0 14)} assume true; {8571#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:23,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {8571#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8572#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:23,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {8572#(<= main_~j~0 15)} assume true; {8572#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:23,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {8572#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8573#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:23,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {8573#(<= main_~j~0 16)} assume true; {8573#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:23,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {8573#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8574#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:23,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {8574#(<= main_~j~0 17)} assume true; {8574#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:23,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {8574#(<= main_~j~0 17)} assume !(~j~0 < 100000); {8556#false} is VALID [2018-11-18 23:00:23,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {8556#false} #t~short2 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {8556#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8556#false} is VALID [2018-11-18 23:00:23,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {8556#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {8556#false} is VALID [2018-11-18 23:00:23,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,692 INFO L273 TraceCheckUtils]: 47: Hoare triple {8556#false} #t~short2 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {8556#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8556#false} is VALID [2018-11-18 23:00:23,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {8556#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {8556#false} is VALID [2018-11-18 23:00:23,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {8556#false} #t~short2 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {8556#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8556#false} is VALID [2018-11-18 23:00:23,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {8556#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {8556#false} ~i~0 := 0; {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {8556#false} #t~short5 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {8556#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {8556#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8556#false} is VALID [2018-11-18 23:00:23,694 INFO L256 TraceCheckUtils]: 59: Hoare triple {8556#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8555#true} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {8555#true} ~cond := #in~cond; {8555#true} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {8555#true} assume !(0 == ~cond); {8555#true} is VALID [2018-11-18 23:00:23,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {8555#true} assume true; {8555#true} is VALID [2018-11-18 23:00:23,695 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {8555#true} {8556#false} #79#return; {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 64: Hoare triple {8556#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {8556#false} #t~short5 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {8556#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {8556#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8556#false} is VALID [2018-11-18 23:00:23,695 INFO L256 TraceCheckUtils]: 69: Hoare triple {8556#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8555#true} is VALID [2018-11-18 23:00:23,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {8555#true} ~cond := #in~cond; {8555#true} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {8555#true} assume !(0 == ~cond); {8555#true} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 72: Hoare triple {8555#true} assume true; {8555#true} is VALID [2018-11-18 23:00:23,696 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {8555#true} {8556#false} #79#return; {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {8556#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {8556#false} assume true; {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 76: Hoare triple {8556#false} #t~short5 := ~i~0 < 100000; {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 77: Hoare triple {8556#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L273 TraceCheckUtils]: 78: Hoare triple {8556#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8556#false} is VALID [2018-11-18 23:00:23,696 INFO L256 TraceCheckUtils]: 79: Hoare triple {8556#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8556#false} is VALID [2018-11-18 23:00:23,697 INFO L273 TraceCheckUtils]: 80: Hoare triple {8556#false} ~cond := #in~cond; {8556#false} is VALID [2018-11-18 23:00:23,697 INFO L273 TraceCheckUtils]: 81: Hoare triple {8556#false} assume 0 == ~cond; {8556#false} is VALID [2018-11-18 23:00:23,697 INFO L273 TraceCheckUtils]: 82: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2018-11-18 23:00:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 4 proven. 306 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 23:00:23,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:23,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:00:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:00:23,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 23:00:23,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:23,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:24,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8555#true} is VALID [2018-11-18 23:00:24,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {8555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8555#true} is VALID [2018-11-18 23:00:24,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2018-11-18 23:00:24,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #75#return; {8555#true} is VALID [2018-11-18 23:00:24,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret8 := main(); {8555#true} is VALID [2018-11-18 23:00:24,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {8555#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,287 INFO L273 TraceCheckUtils]: 38: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,288 INFO L273 TraceCheckUtils]: 39: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !(~j~0 < 100000); {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {8593#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume true; {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} #t~short2 := ~i~0 < 100000; {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {8714#(and (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} assume true; {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} #t~short2 := ~i~0 < 100000; {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,298 INFO L273 TraceCheckUtils]: 52: Hoare triple {8727#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {8737#(and (= 0 |main_~#src~0.offset|) (or (and (not (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8)))) |main_#t~short2|) (and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (not |main_#t~short2|))))} is VALID [2018-11-18 23:00:24,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#(and (= 0 |main_~#src~0.offset|) (or (and (not (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8)))) |main_#t~short2|) (and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (not |main_#t~short2|))))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {8741#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {8741#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|))} ~i~0 := 0; {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume true; {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,305 INFO L256 TraceCheckUtils]: 59: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} ~cond := #in~cond; {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,306 INFO L273 TraceCheckUtils]: 61: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} assume !(0 == ~cond); {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,307 INFO L273 TraceCheckUtils]: 62: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} assume true; {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,307 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} #79#return; {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} is VALID [2018-11-18 23:00:24,308 INFO L273 TraceCheckUtils]: 64: Hoare triple {8745#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,308 INFO L273 TraceCheckUtils]: 65: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume true; {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,309 INFO L273 TraceCheckUtils]: 66: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} #t~short5 := ~i~0 < 100000; {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,310 INFO L273 TraceCheckUtils]: 67: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,312 INFO L256 TraceCheckUtils]: 69: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} ~cond := #in~cond; {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,313 INFO L273 TraceCheckUtils]: 71: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} assume !(0 == ~cond); {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,314 INFO L273 TraceCheckUtils]: 72: Hoare triple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} assume true; {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-18 23:00:24,315 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {8761#(exists ((|v_main_~#src~0.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_3|) 8)))} {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} #79#return; {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} is VALID [2018-11-18 23:00:24,316 INFO L273 TraceCheckUtils]: 74: Hoare triple {8777#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= 0 |main_~#src~0.offset|) (= main_~i~0 1))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,316 INFO L273 TraceCheckUtils]: 75: Hoare triple {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} assume true; {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,317 INFO L273 TraceCheckUtils]: 76: Hoare triple {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} #t~short5 := ~i~0 < 100000; {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} is VALID [2018-11-18 23:00:24,318 INFO L273 TraceCheckUtils]: 77: Hoare triple {8808#(and (= 0 (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 2) (= 0 |main_~#src~0.offset|))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8818#(not |main_#t~short5|)} is VALID [2018-11-18 23:00:24,319 INFO L273 TraceCheckUtils]: 78: Hoare triple {8818#(not |main_#t~short5|)} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {8556#false} is VALID [2018-11-18 23:00:24,319 INFO L256 TraceCheckUtils]: 79: Hoare triple {8556#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8556#false} is VALID [2018-11-18 23:00:24,319 INFO L273 TraceCheckUtils]: 80: Hoare triple {8556#false} ~cond := #in~cond; {8556#false} is VALID [2018-11-18 23:00:24,319 INFO L273 TraceCheckUtils]: 81: Hoare triple {8556#false} assume 0 == ~cond; {8556#false} is VALID [2018-11-18 23:00:24,319 INFO L273 TraceCheckUtils]: 82: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2018-11-18 23:00:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 23:00:24,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:24,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2018-11-18 23:00:24,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2018-11-18 23:00:24,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:24,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 23:00:24,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:24,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 23:00:24,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 23:00:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2018-11-18 23:00:24,471 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 30 states. [2018-11-18 23:00:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:28,038 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2018-11-18 23:00:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 23:00:28,038 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2018-11-18 23:00:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 23:00:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2018-11-18 23:00:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 23:00:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 144 transitions. [2018-11-18 23:00:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 144 transitions. [2018-11-18 23:00:28,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:28,195 INFO L225 Difference]: With dead ends: 181 [2018-11-18 23:00:28,195 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 23:00:28,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 23:00:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 23:00:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-18 23:00:28,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:28,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 92 states. [2018-11-18 23:00:28,299 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 92 states. [2018-11-18 23:00:28,299 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 92 states. [2018-11-18 23:00:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:28,302 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-18 23:00:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-18 23:00:28,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:28,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:28,303 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 112 states. [2018-11-18 23:00:28,303 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 112 states. [2018-11-18 23:00:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:28,306 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-18 23:00:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-18 23:00:28,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:28,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:28,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:28,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 23:00:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-18 23:00:28,308 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 83 [2018-11-18 23:00:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:28,309 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-18 23:00:28,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 23:00:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-18 23:00:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 23:00:28,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:28,310 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:28,310 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:28,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 589697709, now seen corresponding path program 4 times [2018-11-18 23:00:28,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:28,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:28,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:29,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {9456#true} call ULTIMATE.init(); {9456#true} is VALID [2018-11-18 23:00:29,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {9456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9456#true} is VALID [2018-11-18 23:00:29,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {9456#true} assume true; {9456#true} is VALID [2018-11-18 23:00:29,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9456#true} {9456#true} #75#return; {9456#true} is VALID [2018-11-18 23:00:29,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {9456#true} call #t~ret8 := main(); {9456#true} is VALID [2018-11-18 23:00:29,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {9456#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9458#(= main_~j~0 0)} is VALID [2018-11-18 23:00:29,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {9458#(= main_~j~0 0)} assume true; {9458#(= main_~j~0 0)} is VALID [2018-11-18 23:00:29,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {9458#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9459#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:29,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {9459#(<= main_~j~0 1)} assume true; {9459#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:29,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {9459#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9460#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:29,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {9460#(<= main_~j~0 2)} assume true; {9460#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:29,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {9460#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9461#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:29,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {9461#(<= main_~j~0 3)} assume true; {9461#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:29,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {9461#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9462#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:29,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {9462#(<= main_~j~0 4)} assume true; {9462#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:29,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {9462#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9463#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:29,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {9463#(<= main_~j~0 5)} assume true; {9463#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:29,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {9463#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9464#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:29,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {9464#(<= main_~j~0 6)} assume true; {9464#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:29,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {9464#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9465#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:29,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {9465#(<= main_~j~0 7)} assume true; {9465#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:29,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {9465#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9466#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:29,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {9466#(<= main_~j~0 8)} assume true; {9466#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:29,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {9466#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9467#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:29,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {9467#(<= main_~j~0 9)} assume true; {9467#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:29,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {9467#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9468#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:29,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {9468#(<= main_~j~0 10)} assume true; {9468#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:29,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {9468#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9469#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:29,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {9469#(<= main_~j~0 11)} assume true; {9469#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:29,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {9469#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9470#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:29,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {9470#(<= main_~j~0 12)} assume true; {9470#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:29,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {9470#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9471#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:29,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {9471#(<= main_~j~0 13)} assume true; {9471#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:29,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {9471#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9472#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:29,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {9472#(<= main_~j~0 14)} assume true; {9472#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:29,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {9472#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9473#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:29,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {9473#(<= main_~j~0 15)} assume true; {9473#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:29,367 INFO L273 TraceCheckUtils]: 37: Hoare triple {9473#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9474#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:29,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {9474#(<= main_~j~0 16)} assume true; {9474#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:29,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {9474#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9475#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:29,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {9475#(<= main_~j~0 17)} assume true; {9475#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:29,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {9475#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9476#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:29,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {9476#(<= main_~j~0 18)} assume true; {9476#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:29,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {9476#(<= main_~j~0 18)} assume !(~j~0 < 100000); {9457#false} is VALID [2018-11-18 23:00:29,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,371 INFO L273 TraceCheckUtils]: 45: Hoare triple {9457#false} #t~short2 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {9457#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {9457#false} is VALID [2018-11-18 23:00:29,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {9457#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {9457#false} #t~short2 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,372 INFO L273 TraceCheckUtils]: 50: Hoare triple {9457#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {9457#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {9457#false} #t~short2 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 54: Hoare triple {9457#false} assume !#t~short2; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 55: Hoare triple {9457#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {9457#false} is VALID [2018-11-18 23:00:29,373 INFO L273 TraceCheckUtils]: 56: Hoare triple {9457#false} ~i~0 := 0; {9457#false} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,374 INFO L256 TraceCheckUtils]: 61: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9456#true} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 62: Hoare triple {9456#true} ~cond := #in~cond; {9456#true} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#true} assume !(0 == ~cond); {9456#true} is VALID [2018-11-18 23:00:29,374 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#true} assume true; {9456#true} is VALID [2018-11-18 23:00:29,374 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {9456#true} {9457#false} #79#return; {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {9457#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L273 TraceCheckUtils]: 67: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L273 TraceCheckUtils]: 69: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L273 TraceCheckUtils]: 70: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,375 INFO L256 TraceCheckUtils]: 71: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9456#true} is VALID [2018-11-18 23:00:29,376 INFO L273 TraceCheckUtils]: 72: Hoare triple {9456#true} ~cond := #in~cond; {9456#true} is VALID [2018-11-18 23:00:29,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {9456#true} assume !(0 == ~cond); {9456#true} is VALID [2018-11-18 23:00:29,376 INFO L273 TraceCheckUtils]: 74: Hoare triple {9456#true} assume true; {9456#true} is VALID [2018-11-18 23:00:29,376 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {9456#true} {9457#false} #79#return; {9457#false} is VALID [2018-11-18 23:00:29,376 INFO L273 TraceCheckUtils]: 76: Hoare triple {9457#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,376 INFO L273 TraceCheckUtils]: 77: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L273 TraceCheckUtils]: 78: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L273 TraceCheckUtils]: 80: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L256 TraceCheckUtils]: 81: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L273 TraceCheckUtils]: 82: Hoare triple {9457#false} ~cond := #in~cond; {9457#false} is VALID [2018-11-18 23:00:29,377 INFO L273 TraceCheckUtils]: 83: Hoare triple {9457#false} assume 0 == ~cond; {9457#false} is VALID [2018-11-18 23:00:29,378 INFO L273 TraceCheckUtils]: 84: Hoare triple {9457#false} assume !false; {9457#false} is VALID [2018-11-18 23:00:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 4 proven. 342 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 23:00:29,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:29,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:00:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:00:29,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:00:29,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:29,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:29,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {9456#true} call ULTIMATE.init(); {9456#true} is VALID [2018-11-18 23:00:29,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {9456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9456#true} is VALID [2018-11-18 23:00:29,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {9456#true} assume true; {9456#true} is VALID [2018-11-18 23:00:29,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9456#true} {9456#true} #75#return; {9456#true} is VALID [2018-11-18 23:00:29,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {9456#true} call #t~ret8 := main(); {9456#true} is VALID [2018-11-18 23:00:29,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {9456#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,660 INFO L273 TraceCheckUtils]: 25: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {9495#(<= main_~i~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {9495#(<= main_~i~0 0)} assume !(~j~0 < 100000); {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,670 INFO L273 TraceCheckUtils]: 44: Hoare triple {9495#(<= main_~i~0 0)} assume true; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {9495#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {9495#(<= main_~i~0 0)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {9495#(<= main_~i~0 0)} is VALID [2018-11-18 23:00:29,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {9495#(<= main_~i~0 0)} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {9622#(<= main_~i~0 1)} is VALID [2018-11-18 23:00:29,673 INFO L273 TraceCheckUtils]: 48: Hoare triple {9622#(<= main_~i~0 1)} assume true; {9622#(<= main_~i~0 1)} is VALID [2018-11-18 23:00:29,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {9622#(<= main_~i~0 1)} #t~short2 := ~i~0 < 100000; {9622#(<= main_~i~0 1)} is VALID [2018-11-18 23:00:29,674 INFO L273 TraceCheckUtils]: 50: Hoare triple {9622#(<= main_~i~0 1)} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {9622#(<= main_~i~0 1)} is VALID [2018-11-18 23:00:29,675 INFO L273 TraceCheckUtils]: 51: Hoare triple {9622#(<= main_~i~0 1)} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {9635#(<= main_~i~0 2)} is VALID [2018-11-18 23:00:29,675 INFO L273 TraceCheckUtils]: 52: Hoare triple {9635#(<= main_~i~0 2)} assume true; {9635#(<= main_~i~0 2)} is VALID [2018-11-18 23:00:29,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {9635#(<= main_~i~0 2)} #t~short2 := ~i~0 < 100000; {9642#|main_#t~short2|} is VALID [2018-11-18 23:00:29,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {9642#|main_#t~short2|} assume !#t~short2; {9457#false} is VALID [2018-11-18 23:00:29,677 INFO L273 TraceCheckUtils]: 55: Hoare triple {9457#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {9457#false} is VALID [2018-11-18 23:00:29,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {9457#false} ~i~0 := 0; {9457#false} is VALID [2018-11-18 23:00:29,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,678 INFO L273 TraceCheckUtils]: 58: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,678 INFO L273 TraceCheckUtils]: 60: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,678 INFO L256 TraceCheckUtils]: 61: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9457#false} is VALID [2018-11-18 23:00:29,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {9457#false} ~cond := #in~cond; {9457#false} is VALID [2018-11-18 23:00:29,679 INFO L273 TraceCheckUtils]: 63: Hoare triple {9457#false} assume !(0 == ~cond); {9457#false} is VALID [2018-11-18 23:00:29,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,679 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {9457#false} {9457#false} #79#return; {9457#false} is VALID [2018-11-18 23:00:29,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {9457#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,680 INFO L273 TraceCheckUtils]: 68: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,680 INFO L273 TraceCheckUtils]: 69: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,680 INFO L273 TraceCheckUtils]: 70: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,680 INFO L256 TraceCheckUtils]: 71: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9457#false} is VALID [2018-11-18 23:00:29,680 INFO L273 TraceCheckUtils]: 72: Hoare triple {9457#false} ~cond := #in~cond; {9457#false} is VALID [2018-11-18 23:00:29,681 INFO L273 TraceCheckUtils]: 73: Hoare triple {9457#false} assume !(0 == ~cond); {9457#false} is VALID [2018-11-18 23:00:29,681 INFO L273 TraceCheckUtils]: 74: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,681 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {9457#false} {9457#false} #79#return; {9457#false} is VALID [2018-11-18 23:00:29,681 INFO L273 TraceCheckUtils]: 76: Hoare triple {9457#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 77: Hoare triple {9457#false} assume true; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 78: Hoare triple {9457#false} #t~short5 := ~i~0 < 100000; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 79: Hoare triple {9457#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 80: Hoare triple {9457#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L256 TraceCheckUtils]: 81: Hoare triple {9457#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 82: Hoare triple {9457#false} ~cond := #in~cond; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 83: Hoare triple {9457#false} assume 0 == ~cond; {9457#false} is VALID [2018-11-18 23:00:29,682 INFO L273 TraceCheckUtils]: 84: Hoare triple {9457#false} assume !false; {9457#false} is VALID [2018-11-18 23:00:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-18 23:00:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:29,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6] total 25 [2018-11-18 23:00:29,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-11-18 23:00:29,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:29,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 23:00:29,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:29,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 23:00:29,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 23:00:29,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2018-11-18 23:00:29,801 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 25 states. [2018-11-18 23:00:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:31,223 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-18 23:00:31,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 23:00:31,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-11-18 23:00:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:00:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-18 23:00:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:00:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-18 23:00:31,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2018-11-18 23:00:31,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:31,341 INFO L225 Difference]: With dead ends: 149 [2018-11-18 23:00:31,342 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 23:00:31,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=695, Invalid=1467, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 23:00:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 23:00:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-11-18 23:00:31,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:31,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 94 states. [2018-11-18 23:00:31,474 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 94 states. [2018-11-18 23:00:31,474 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 94 states. [2018-11-18 23:00:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:31,477 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-18 23:00:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-18 23:00:31,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:31,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:31,477 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 101 states. [2018-11-18 23:00:31,477 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 101 states. [2018-11-18 23:00:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:31,479 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-18 23:00:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-18 23:00:31,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:31,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:31,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:31,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 23:00:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-11-18 23:00:31,482 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 85 [2018-11-18 23:00:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:31,482 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-11-18 23:00:31,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 23:00:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-11-18 23:00:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 23:00:31,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:31,483 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:31,483 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:31,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1421369499, now seen corresponding path program 10 times [2018-11-18 23:00:31,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:31,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:31,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:31,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {10301#true} call ULTIMATE.init(); {10301#true} is VALID [2018-11-18 23:00:31,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {10301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10301#true} is VALID [2018-11-18 23:00:31,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {10301#true} assume true; {10301#true} is VALID [2018-11-18 23:00:31,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10301#true} {10301#true} #75#return; {10301#true} is VALID [2018-11-18 23:00:31,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {10301#true} call #t~ret8 := main(); {10301#true} is VALID [2018-11-18 23:00:31,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {10301#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10303#(= main_~j~0 0)} is VALID [2018-11-18 23:00:31,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {10303#(= main_~j~0 0)} assume true; {10303#(= main_~j~0 0)} is VALID [2018-11-18 23:00:31,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {10303#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10304#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:31,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {10304#(<= main_~j~0 1)} assume true; {10304#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:31,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {10304#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10305#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:31,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {10305#(<= main_~j~0 2)} assume true; {10305#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:31,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {10305#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10306#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:31,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {10306#(<= main_~j~0 3)} assume true; {10306#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:31,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {10306#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10307#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:31,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {10307#(<= main_~j~0 4)} assume true; {10307#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:31,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {10307#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10308#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:31,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {10308#(<= main_~j~0 5)} assume true; {10308#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:31,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {10308#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10309#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:31,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {10309#(<= main_~j~0 6)} assume true; {10309#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:31,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {10309#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10310#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:31,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {10310#(<= main_~j~0 7)} assume true; {10310#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:31,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {10310#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10311#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:31,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {10311#(<= main_~j~0 8)} assume true; {10311#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:31,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {10311#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10312#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:31,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {10312#(<= main_~j~0 9)} assume true; {10312#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:31,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {10312#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10313#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:31,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {10313#(<= main_~j~0 10)} assume true; {10313#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:31,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {10313#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10314#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:31,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {10314#(<= main_~j~0 11)} assume true; {10314#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:31,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {10314#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10315#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:31,851 INFO L273 TraceCheckUtils]: 30: Hoare triple {10315#(<= main_~j~0 12)} assume true; {10315#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:31,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {10315#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10316#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:31,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {10316#(<= main_~j~0 13)} assume true; {10316#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:31,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {10316#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10317#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:31,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {10317#(<= main_~j~0 14)} assume true; {10317#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:31,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {10317#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10318#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:31,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {10318#(<= main_~j~0 15)} assume true; {10318#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:31,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {10318#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10319#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:31,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {10319#(<= main_~j~0 16)} assume true; {10319#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:31,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {10319#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10320#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:31,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {10320#(<= main_~j~0 17)} assume true; {10320#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:31,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {10320#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10321#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:31,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {10321#(<= main_~j~0 18)} assume true; {10321#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:31,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {10321#(<= main_~j~0 18)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10322#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:31,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {10322#(<= main_~j~0 19)} assume true; {10322#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:31,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {10322#(<= main_~j~0 19)} assume !(~j~0 < 100000); {10302#false} is VALID [2018-11-18 23:00:31,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,863 INFO L273 TraceCheckUtils]: 47: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:31,864 INFO L273 TraceCheckUtils]: 49: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:31,864 INFO L273 TraceCheckUtils]: 50: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:31,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:31,865 INFO L273 TraceCheckUtils]: 54: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:31,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 61: Hoare triple {10302#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {10302#false} ~i~0 := 0; {10302#false} is VALID [2018-11-18 23:00:31,866 INFO L273 TraceCheckUtils]: 63: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,867 INFO L273 TraceCheckUtils]: 64: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,867 INFO L273 TraceCheckUtils]: 65: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:31,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:31,867 INFO L256 TraceCheckUtils]: 67: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10301#true} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {10301#true} ~cond := #in~cond; {10301#true} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {10301#true} assume !(0 == ~cond); {10301#true} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 70: Hoare triple {10301#true} assume true; {10301#true} is VALID [2018-11-18 23:00:31,868 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {10301#true} {10302#false} #79#return; {10302#false} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 72: Hoare triple {10302#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 73: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,868 INFO L273 TraceCheckUtils]: 74: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 76: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:31,869 INFO L256 TraceCheckUtils]: 77: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10301#true} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 78: Hoare triple {10301#true} ~cond := #in~cond; {10301#true} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 79: Hoare triple {10301#true} assume !(0 == ~cond); {10301#true} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 80: Hoare triple {10301#true} assume true; {10301#true} is VALID [2018-11-18 23:00:31,869 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {10301#true} {10302#false} #79#return; {10302#false} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 82: Hoare triple {10302#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:31,869 INFO L273 TraceCheckUtils]: 83: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 84: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 85: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 86: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L256 TraceCheckUtils]: 87: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 88: Hoare triple {10302#false} ~cond := #in~cond; {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 89: Hoare triple {10302#false} assume 0 == ~cond; {10302#false} is VALID [2018-11-18 23:00:31,870 INFO L273 TraceCheckUtils]: 90: Hoare triple {10302#false} assume !false; {10302#false} is VALID [2018-11-18 23:00:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 4 proven. 380 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 23:00:31,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:31,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 23:00:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:00:31,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:00:31,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:31,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:32,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {10301#true} call ULTIMATE.init(); {10301#true} is VALID [2018-11-18 23:00:32,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {10301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10301#true} is VALID [2018-11-18 23:00:32,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {10301#true} assume true; {10301#true} is VALID [2018-11-18 23:00:32,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10301#true} {10301#true} #75#return; {10301#true} is VALID [2018-11-18 23:00:32,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {10301#true} call #t~ret8 := main(); {10301#true} is VALID [2018-11-18 23:00:32,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {10301#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10341#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:32,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {10341#(<= main_~j~0 0)} assume true; {10341#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:32,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {10341#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10304#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:32,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {10304#(<= main_~j~0 1)} assume true; {10304#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:32,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {10304#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10305#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:32,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {10305#(<= main_~j~0 2)} assume true; {10305#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:32,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {10305#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10306#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:32,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {10306#(<= main_~j~0 3)} assume true; {10306#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:32,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {10306#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10307#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:32,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {10307#(<= main_~j~0 4)} assume true; {10307#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:32,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {10307#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10308#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:32,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {10308#(<= main_~j~0 5)} assume true; {10308#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:32,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {10308#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10309#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:32,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {10309#(<= main_~j~0 6)} assume true; {10309#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:32,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {10309#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10310#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:32,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {10310#(<= main_~j~0 7)} assume true; {10310#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:32,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {10310#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10311#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:32,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {10311#(<= main_~j~0 8)} assume true; {10311#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:32,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {10311#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10312#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:32,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {10312#(<= main_~j~0 9)} assume true; {10312#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:32,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {10312#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10313#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:32,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {10313#(<= main_~j~0 10)} assume true; {10313#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:32,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {10313#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10314#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:32,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {10314#(<= main_~j~0 11)} assume true; {10314#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:32,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {10314#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10315#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:32,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {10315#(<= main_~j~0 12)} assume true; {10315#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:32,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {10315#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10316#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:32,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {10316#(<= main_~j~0 13)} assume true; {10316#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:32,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {10316#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10317#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:32,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {10317#(<= main_~j~0 14)} assume true; {10317#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:32,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {10317#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10318#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:32,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {10318#(<= main_~j~0 15)} assume true; {10318#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:32,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {10318#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10319#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:32,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {10319#(<= main_~j~0 16)} assume true; {10319#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:32,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {10319#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10320#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:32,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {10320#(<= main_~j~0 17)} assume true; {10320#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:32,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {10320#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10321#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:32,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {10321#(<= main_~j~0 18)} assume true; {10321#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:32,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {10321#(<= main_~j~0 18)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {10322#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:32,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {10322#(<= main_~j~0 19)} assume true; {10322#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:32,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {10322#(<= main_~j~0 19)} assume !(~j~0 < 100000); {10302#false} is VALID [2018-11-18 23:00:32,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:32,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:32,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:32,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:32,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 57: Hoare triple {10302#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 59: Hoare triple {10302#false} #t~short2 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {10302#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 61: Hoare triple {10302#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {10302#false} is VALID [2018-11-18 23:00:32,155 INFO L273 TraceCheckUtils]: 62: Hoare triple {10302#false} ~i~0 := 0; {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 65: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L256 TraceCheckUtils]: 67: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {10302#false} ~cond := #in~cond; {10302#false} is VALID [2018-11-18 23:00:32,156 INFO L273 TraceCheckUtils]: 69: Hoare triple {10302#false} assume !(0 == ~cond); {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 70: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {10302#false} {10302#false} #79#return; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 72: Hoare triple {10302#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:32,157 INFO L256 TraceCheckUtils]: 77: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 78: Hoare triple {10302#false} ~cond := #in~cond; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {10302#false} assume !(0 == ~cond); {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {10302#false} {10302#false} #79#return; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {10302#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {10302#false} assume true; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {10302#false} #t~short5 := ~i~0 < 100000; {10302#false} is VALID [2018-11-18 23:00:32,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {10302#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10302#false} is VALID [2018-11-18 23:00:32,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {10302#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {10302#false} is VALID [2018-11-18 23:00:32,159 INFO L256 TraceCheckUtils]: 87: Hoare triple {10302#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10302#false} is VALID [2018-11-18 23:00:32,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {10302#false} ~cond := #in~cond; {10302#false} is VALID [2018-11-18 23:00:32,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {10302#false} assume 0 == ~cond; {10302#false} is VALID [2018-11-18 23:00:32,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {10302#false} assume !false; {10302#false} is VALID [2018-11-18 23:00:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 23:00:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:32,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 23:00:32,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 23:00:32,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:32,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 23:00:32,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:32,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 23:00:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 23:00:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:00:32,251 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 23 states. [2018-11-18 23:00:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:33,016 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-11-18 23:00:33,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 23:00:33,016 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 23:00:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:00:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2018-11-18 23:00:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:00:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2018-11-18 23:00:33,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 88 transitions. [2018-11-18 23:00:33,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:33,119 INFO L225 Difference]: With dead ends: 144 [2018-11-18 23:00:33,119 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 23:00:33,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 23:00:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 23:00:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-18 23:00:33,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:33,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-18 23:00:33,482 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-18 23:00:33,483 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-18 23:00:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:33,485 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-18 23:00:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-11-18 23:00:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:33,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:33,487 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-18 23:00:33,487 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-18 23:00:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:33,488 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-18 23:00:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-11-18 23:00:33,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:33,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:33,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:33,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 23:00:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-11-18 23:00:33,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 91 [2018-11-18 23:00:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:33,491 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-11-18 23:00:33,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 23:00:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-11-18 23:00:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 23:00:33,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:33,492 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:33,492 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:33,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1784970827, now seen corresponding path program 11 times [2018-11-18 23:00:33,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:33,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:33,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:34,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {11105#true} call ULTIMATE.init(); {11105#true} is VALID [2018-11-18 23:00:34,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {11105#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11105#true} is VALID [2018-11-18 23:00:34,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {11105#true} assume true; {11105#true} is VALID [2018-11-18 23:00:34,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11105#true} {11105#true} #75#return; {11105#true} is VALID [2018-11-18 23:00:34,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {11105#true} call #t~ret8 := main(); {11105#true} is VALID [2018-11-18 23:00:34,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {11105#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11107#(= main_~j~0 0)} is VALID [2018-11-18 23:00:34,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {11107#(= main_~j~0 0)} assume true; {11107#(= main_~j~0 0)} is VALID [2018-11-18 23:00:34,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {11107#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11108#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:34,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {11108#(<= main_~j~0 1)} assume true; {11108#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:34,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {11108#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11109#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:34,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {11109#(<= main_~j~0 2)} assume true; {11109#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:34,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {11109#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11110#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:34,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {11110#(<= main_~j~0 3)} assume true; {11110#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:34,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {11110#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11111#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:34,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {11111#(<= main_~j~0 4)} assume true; {11111#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:34,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {11111#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11112#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:34,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {11112#(<= main_~j~0 5)} assume true; {11112#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:34,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {11112#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11113#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:34,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {11113#(<= main_~j~0 6)} assume true; {11113#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:34,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {11113#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11114#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:34,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {11114#(<= main_~j~0 7)} assume true; {11114#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:34,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {11114#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11115#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:34,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {11115#(<= main_~j~0 8)} assume true; {11115#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:34,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {11115#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11116#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:34,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {11116#(<= main_~j~0 9)} assume true; {11116#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:34,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {11116#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11117#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:34,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {11117#(<= main_~j~0 10)} assume true; {11117#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:34,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {11117#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11118#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:34,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {11118#(<= main_~j~0 11)} assume true; {11118#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:34,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {11118#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11119#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:34,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {11119#(<= main_~j~0 12)} assume true; {11119#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:34,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {11119#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11120#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:34,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {11120#(<= main_~j~0 13)} assume true; {11120#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:34,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {11120#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11121#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:34,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {11121#(<= main_~j~0 14)} assume true; {11121#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:34,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {11121#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11122#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:34,331 INFO L273 TraceCheckUtils]: 36: Hoare triple {11122#(<= main_~j~0 15)} assume true; {11122#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:34,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {11122#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11123#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:34,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {11123#(<= main_~j~0 16)} assume true; {11123#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:34,334 INFO L273 TraceCheckUtils]: 39: Hoare triple {11123#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11124#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:34,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {11124#(<= main_~j~0 17)} assume true; {11124#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:34,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {11124#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11125#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:34,336 INFO L273 TraceCheckUtils]: 42: Hoare triple {11125#(<= main_~j~0 18)} assume true; {11125#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:34,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {11125#(<= main_~j~0 18)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11126#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:34,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {11126#(<= main_~j~0 19)} assume true; {11126#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:34,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {11126#(<= main_~j~0 19)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11127#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:34,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {11127#(<= main_~j~0 20)} assume true; {11127#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:34,339 INFO L273 TraceCheckUtils]: 47: Hoare triple {11127#(<= main_~j~0 20)} assume !(~j~0 < 100000); {11106#false} is VALID [2018-11-18 23:00:34,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,340 INFO L273 TraceCheckUtils]: 50: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:34,340 INFO L273 TraceCheckUtils]: 51: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:34,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,341 INFO L273 TraceCheckUtils]: 53: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,341 INFO L273 TraceCheckUtils]: 54: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:34,341 INFO L273 TraceCheckUtils]: 55: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:34,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 60: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 62: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 63: Hoare triple {11106#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 64: Hoare triple {11106#false} ~i~0 := 0; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 65: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 67: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:34,343 INFO L256 TraceCheckUtils]: 69: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11105#true} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {11105#true} ~cond := #in~cond; {11105#true} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {11105#true} assume !(0 == ~cond); {11105#true} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {11105#true} assume true; {11105#true} is VALID [2018-11-18 23:00:34,343 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {11105#true} {11106#false} #79#return; {11106#false} is VALID [2018-11-18 23:00:34,343 INFO L273 TraceCheckUtils]: 74: Hoare triple {11106#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 75: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 76: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 77: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 78: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:34,344 INFO L256 TraceCheckUtils]: 79: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11105#true} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {11105#true} ~cond := #in~cond; {11105#true} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 81: Hoare triple {11105#true} assume !(0 == ~cond); {11105#true} is VALID [2018-11-18 23:00:34,344 INFO L273 TraceCheckUtils]: 82: Hoare triple {11105#true} assume true; {11105#true} is VALID [2018-11-18 23:00:34,344 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11105#true} {11106#false} #79#return; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 84: Hoare triple {11106#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 85: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 86: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 87: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 88: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L256 TraceCheckUtils]: 89: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {11106#false} ~cond := #in~cond; {11106#false} is VALID [2018-11-18 23:00:34,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {11106#false} assume 0 == ~cond; {11106#false} is VALID [2018-11-18 23:00:34,346 INFO L273 TraceCheckUtils]: 92: Hoare triple {11106#false} assume !false; {11106#false} is VALID [2018-11-18 23:00:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 4 proven. 420 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 23:00:34,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:34,350 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-18 23:00:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:00:34,860 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-18 23:00:34,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:34,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:35,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {11105#true} call ULTIMATE.init(); {11105#true} is VALID [2018-11-18 23:00:35,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {11105#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11105#true} is VALID [2018-11-18 23:00:35,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {11105#true} assume true; {11105#true} is VALID [2018-11-18 23:00:35,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11105#true} {11105#true} #75#return; {11105#true} is VALID [2018-11-18 23:00:35,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {11105#true} call #t~ret8 := main(); {11105#true} is VALID [2018-11-18 23:00:35,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {11105#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11146#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:35,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {11146#(<= main_~j~0 0)} assume true; {11146#(<= main_~j~0 0)} is VALID [2018-11-18 23:00:35,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {11146#(<= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11108#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:35,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {11108#(<= main_~j~0 1)} assume true; {11108#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:35,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {11108#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11109#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:35,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {11109#(<= main_~j~0 2)} assume true; {11109#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:35,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {11109#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11110#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:35,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {11110#(<= main_~j~0 3)} assume true; {11110#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:35,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {11110#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11111#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:35,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {11111#(<= main_~j~0 4)} assume true; {11111#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:35,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {11111#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11112#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:35,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {11112#(<= main_~j~0 5)} assume true; {11112#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:35,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {11112#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11113#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:35,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {11113#(<= main_~j~0 6)} assume true; {11113#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:35,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {11113#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11114#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:35,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {11114#(<= main_~j~0 7)} assume true; {11114#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:35,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {11114#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11115#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:35,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {11115#(<= main_~j~0 8)} assume true; {11115#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:35,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {11115#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11116#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:35,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {11116#(<= main_~j~0 9)} assume true; {11116#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:35,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {11116#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11117#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:35,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {11117#(<= main_~j~0 10)} assume true; {11117#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:35,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {11117#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11118#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:35,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {11118#(<= main_~j~0 11)} assume true; {11118#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:35,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {11118#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11119#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:35,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {11119#(<= main_~j~0 12)} assume true; {11119#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:35,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {11119#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11120#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:35,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {11120#(<= main_~j~0 13)} assume true; {11120#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:35,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {11120#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11121#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:35,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {11121#(<= main_~j~0 14)} assume true; {11121#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:35,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {11121#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11122#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:35,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {11122#(<= main_~j~0 15)} assume true; {11122#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:35,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {11122#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11123#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:35,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {11123#(<= main_~j~0 16)} assume true; {11123#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:35,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {11123#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11124#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:35,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {11124#(<= main_~j~0 17)} assume true; {11124#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:35,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {11124#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11125#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:35,095 INFO L273 TraceCheckUtils]: 42: Hoare triple {11125#(<= main_~j~0 18)} assume true; {11125#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:35,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {11125#(<= main_~j~0 18)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11126#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:35,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {11126#(<= main_~j~0 19)} assume true; {11126#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:35,097 INFO L273 TraceCheckUtils]: 45: Hoare triple {11126#(<= main_~j~0 19)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11127#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:35,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {11127#(<= main_~j~0 20)} assume true; {11127#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:35,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {11127#(<= main_~j~0 20)} assume !(~j~0 < 100000); {11106#false} is VALID [2018-11-18 23:00:35,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:35,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:35,100 INFO L273 TraceCheckUtils]: 52: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,100 INFO L273 TraceCheckUtils]: 53: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:35,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:35,100 INFO L273 TraceCheckUtils]: 56: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 57: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 58: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 59: Hoare triple {11106#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 60: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 61: Hoare triple {11106#false} #t~short2 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 62: Hoare triple {11106#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11106#false} is VALID [2018-11-18 23:00:35,101 INFO L273 TraceCheckUtils]: 63: Hoare triple {11106#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 64: Hoare triple {11106#false} ~i~0 := 0; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 65: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 66: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 67: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 68: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L256 TraceCheckUtils]: 69: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 70: Hoare triple {11106#false} ~cond := #in~cond; {11106#false} is VALID [2018-11-18 23:00:35,102 INFO L273 TraceCheckUtils]: 71: Hoare triple {11106#false} assume !(0 == ~cond); {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 72: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {11106#false} {11106#false} #79#return; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 74: Hoare triple {11106#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 75: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 78: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L256 TraceCheckUtils]: 79: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11106#false} is VALID [2018-11-18 23:00:35,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {11106#false} ~cond := #in~cond; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 81: Hoare triple {11106#false} assume !(0 == ~cond); {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 82: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11106#false} {11106#false} #79#return; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 84: Hoare triple {11106#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 85: Hoare triple {11106#false} assume true; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 86: Hoare triple {11106#false} #t~short5 := ~i~0 < 100000; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 87: Hoare triple {11106#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L273 TraceCheckUtils]: 88: Hoare triple {11106#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11106#false} is VALID [2018-11-18 23:00:35,104 INFO L256 TraceCheckUtils]: 89: Hoare triple {11106#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11106#false} is VALID [2018-11-18 23:00:35,105 INFO L273 TraceCheckUtils]: 90: Hoare triple {11106#false} ~cond := #in~cond; {11106#false} is VALID [2018-11-18 23:00:35,105 INFO L273 TraceCheckUtils]: 91: Hoare triple {11106#false} assume 0 == ~cond; {11106#false} is VALID [2018-11-18 23:00:35,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {11106#false} assume !false; {11106#false} is VALID [2018-11-18 23:00:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 23:00:35,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:35,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 23:00:35,130 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-11-18 23:00:35,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:35,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 23:00:35,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 23:00:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 23:00:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 23:00:35,263 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 24 states. [2018-11-18 23:00:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:36,320 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-11-18 23:00:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 23:00:36,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-11-18 23:00:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:00:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:00:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2018-11-18 23:00:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:00:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2018-11-18 23:00:36,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 90 transitions. [2018-11-18 23:00:36,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:36,408 INFO L225 Difference]: With dead ends: 146 [2018-11-18 23:00:36,408 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 23:00:36,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 23:00:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 23:00:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-18 23:00:36,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:00:36,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2018-11-18 23:00:36,533 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-18 23:00:36,533 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-18 23:00:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:36,536 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-18 23:00:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-18 23:00:36,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:36,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:36,537 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-18 23:00:36,537 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-18 23:00:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:00:36,538 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-18 23:00:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-18 23:00:36,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:00:36,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:00:36,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:00:36,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:00:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 23:00:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-18 23:00:36,542 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 93 [2018-11-18 23:00:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:00:36,542 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-18 23:00:36,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 23:00:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-18 23:00:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 23:00:36,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:00:36,543 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:00:36,543 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:00:36,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:00:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 708494415, now seen corresponding path program 12 times [2018-11-18 23:00:36,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:00:36,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:00:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:36,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:00:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:00:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:36,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {11926#true} call ULTIMATE.init(); {11926#true} is VALID [2018-11-18 23:00:36,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {11926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11926#true} is VALID [2018-11-18 23:00:36,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {11926#true} assume true; {11926#true} is VALID [2018-11-18 23:00:36,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11926#true} {11926#true} #75#return; {11926#true} is VALID [2018-11-18 23:00:36,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {11926#true} call #t~ret8 := main(); {11926#true} is VALID [2018-11-18 23:00:36,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {11926#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11928#(= main_~j~0 0)} is VALID [2018-11-18 23:00:36,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {11928#(= main_~j~0 0)} assume true; {11928#(= main_~j~0 0)} is VALID [2018-11-18 23:00:36,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {11928#(= main_~j~0 0)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11929#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:36,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {11929#(<= main_~j~0 1)} assume true; {11929#(<= main_~j~0 1)} is VALID [2018-11-18 23:00:36,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {11929#(<= main_~j~0 1)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11930#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:36,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {11930#(<= main_~j~0 2)} assume true; {11930#(<= main_~j~0 2)} is VALID [2018-11-18 23:00:36,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {11930#(<= main_~j~0 2)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11931#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:36,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {11931#(<= main_~j~0 3)} assume true; {11931#(<= main_~j~0 3)} is VALID [2018-11-18 23:00:36,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {11931#(<= main_~j~0 3)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11932#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:36,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {11932#(<= main_~j~0 4)} assume true; {11932#(<= main_~j~0 4)} is VALID [2018-11-18 23:00:36,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {11932#(<= main_~j~0 4)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11933#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:36,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {11933#(<= main_~j~0 5)} assume true; {11933#(<= main_~j~0 5)} is VALID [2018-11-18 23:00:36,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {11933#(<= main_~j~0 5)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11934#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:36,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {11934#(<= main_~j~0 6)} assume true; {11934#(<= main_~j~0 6)} is VALID [2018-11-18 23:00:36,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {11934#(<= main_~j~0 6)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11935#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:36,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {11935#(<= main_~j~0 7)} assume true; {11935#(<= main_~j~0 7)} is VALID [2018-11-18 23:00:36,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {11935#(<= main_~j~0 7)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11936#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:36,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {11936#(<= main_~j~0 8)} assume true; {11936#(<= main_~j~0 8)} is VALID [2018-11-18 23:00:36,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {11936#(<= main_~j~0 8)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11937#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:36,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {11937#(<= main_~j~0 9)} assume true; {11937#(<= main_~j~0 9)} is VALID [2018-11-18 23:00:36,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {11937#(<= main_~j~0 9)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11938#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:36,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {11938#(<= main_~j~0 10)} assume true; {11938#(<= main_~j~0 10)} is VALID [2018-11-18 23:00:36,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {11938#(<= main_~j~0 10)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11939#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:36,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {11939#(<= main_~j~0 11)} assume true; {11939#(<= main_~j~0 11)} is VALID [2018-11-18 23:00:36,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {11939#(<= main_~j~0 11)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11940#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:36,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {11940#(<= main_~j~0 12)} assume true; {11940#(<= main_~j~0 12)} is VALID [2018-11-18 23:00:36,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {11940#(<= main_~j~0 12)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11941#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:36,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {11941#(<= main_~j~0 13)} assume true; {11941#(<= main_~j~0 13)} is VALID [2018-11-18 23:00:36,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {11941#(<= main_~j~0 13)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11942#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:36,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {11942#(<= main_~j~0 14)} assume true; {11942#(<= main_~j~0 14)} is VALID [2018-11-18 23:00:36,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {11942#(<= main_~j~0 14)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11943#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:36,989 INFO L273 TraceCheckUtils]: 36: Hoare triple {11943#(<= main_~j~0 15)} assume true; {11943#(<= main_~j~0 15)} is VALID [2018-11-18 23:00:36,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {11943#(<= main_~j~0 15)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11944#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:36,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {11944#(<= main_~j~0 16)} assume true; {11944#(<= main_~j~0 16)} is VALID [2018-11-18 23:00:36,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {11944#(<= main_~j~0 16)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11945#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:36,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {11945#(<= main_~j~0 17)} assume true; {11945#(<= main_~j~0 17)} is VALID [2018-11-18 23:00:36,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {11945#(<= main_~j~0 17)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11946#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:36,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {11946#(<= main_~j~0 18)} assume true; {11946#(<= main_~j~0 18)} is VALID [2018-11-18 23:00:36,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {11946#(<= main_~j~0 18)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11947#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:36,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {11947#(<= main_~j~0 19)} assume true; {11947#(<= main_~j~0 19)} is VALID [2018-11-18 23:00:36,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {11947#(<= main_~j~0 19)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11948#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:36,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {11948#(<= main_~j~0 20)} assume true; {11948#(<= main_~j~0 20)} is VALID [2018-11-18 23:00:36,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {11948#(<= main_~j~0 20)} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11949#(<= main_~j~0 21)} is VALID [2018-11-18 23:00:36,998 INFO L273 TraceCheckUtils]: 48: Hoare triple {11949#(<= main_~j~0 21)} assume true; {11949#(<= main_~j~0 21)} is VALID [2018-11-18 23:00:36,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {11949#(<= main_~j~0 21)} assume !(~j~0 < 100000); {11927#false} is VALID [2018-11-18 23:00:36,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:36,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {11927#false} #t~short2 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:36,999 INFO L273 TraceCheckUtils]: 52: Hoare triple {11927#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11927#false} is VALID [2018-11-18 23:00:36,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {11927#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11927#false} is VALID [2018-11-18 23:00:36,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {11927#false} #t~short2 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {11927#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11927#false} is VALID [2018-11-18 23:00:37,000 INFO L273 TraceCheckUtils]: 57: Hoare triple {11927#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11927#false} is VALID [2018-11-18 23:00:37,000 INFO L273 TraceCheckUtils]: 58: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {11927#false} #t~short2 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {11927#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11927#false} is VALID [2018-11-18 23:00:37,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {11927#false} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {11927#false} is VALID [2018-11-18 23:00:37,001 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,001 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#false} #t~short2 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {11927#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {11927#false} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {11927#false} ~i~0 := 0; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {11927#false} #t~short5 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 69: Hoare triple {11927#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L273 TraceCheckUtils]: 70: Hoare triple {11927#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11927#false} is VALID [2018-11-18 23:00:37,002 INFO L256 TraceCheckUtils]: 71: Hoare triple {11927#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11926#true} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 72: Hoare triple {11926#true} ~cond := #in~cond; {11926#true} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {11926#true} assume !(0 == ~cond); {11926#true} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {11926#true} assume true; {11926#true} is VALID [2018-11-18 23:00:37,003 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {11926#true} {11927#false} #79#return; {11927#false} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 76: Hoare triple {11927#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11927#false} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 77: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,003 INFO L273 TraceCheckUtils]: 78: Hoare triple {11927#false} #t~short5 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,004 INFO L273 TraceCheckUtils]: 79: Hoare triple {11927#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11927#false} is VALID [2018-11-18 23:00:37,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {11927#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11927#false} is VALID [2018-11-18 23:00:37,004 INFO L256 TraceCheckUtils]: 81: Hoare triple {11927#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11926#true} is VALID [2018-11-18 23:00:37,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {11926#true} ~cond := #in~cond; {11926#true} is VALID [2018-11-18 23:00:37,004 INFO L273 TraceCheckUtils]: 83: Hoare triple {11926#true} assume !(0 == ~cond); {11926#true} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {11926#true} assume true; {11926#true} is VALID [2018-11-18 23:00:37,005 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11926#true} {11927#false} #79#return; {11927#false} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {11927#false} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {11927#false} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {11927#false} assume true; {11927#false} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {11927#false} #t~short5 := ~i~0 < 100000; {11927#false} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {11927#false} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11927#false} is VALID [2018-11-18 23:00:37,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {11927#false} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {11927#false} is VALID [2018-11-18 23:00:37,006 INFO L256 TraceCheckUtils]: 91: Hoare triple {11927#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11927#false} is VALID [2018-11-18 23:00:37,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {11927#false} ~cond := #in~cond; {11927#false} is VALID [2018-11-18 23:00:37,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {11927#false} assume 0 == ~cond; {11927#false} is VALID [2018-11-18 23:00:37,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {11927#false} assume !false; {11927#false} is VALID [2018-11-18 23:00:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 4 proven. 462 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 23:00:37,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:00:37,012 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-18 23:00:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:00:37,079 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 23:00:37,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:00:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:00:37,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:00:37,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 23:00:37,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:00:37,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:00:37,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 23:00:37,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-18 23:00:37,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 23:00:37,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:00:37,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:00:37,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:00:37,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-18 23:00:39,507 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8))))) is different from true [2018-11-18 23:00:40,032 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 23:00:42,361 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))) is different from true [2018-11-18 23:00:44,413 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 23:00:46,502 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 23:00:46,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-18 23:00:46,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-18 23:00:46,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:00:46,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 23:00:46,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:00:46,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:00:46,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:00:46,662 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-11-18 23:00:46,664 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:00:48,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {11926#true} call ULTIMATE.init(); {11926#true} is VALID [2018-11-18 23:00:48,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {11926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11926#true} is VALID [2018-11-18 23:00:48,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {11926#true} assume true; {11926#true} is VALID [2018-11-18 23:00:48,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11926#true} {11926#true} #75#return; {11926#true} is VALID [2018-11-18 23:00:48,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {11926#true} call #t~ret8 := main(); {11926#true} is VALID [2018-11-18 23:00:48,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {11926#true} call ~#src~0.base, ~#src~0.offset := #Ultimate.alloc(400000);call ~#dst~0.base, ~#dst~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,750 INFO L273 TraceCheckUtils]: 25: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,756 INFO L273 TraceCheckUtils]: 33: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,764 INFO L273 TraceCheckUtils]: 43: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,765 INFO L273 TraceCheckUtils]: 44: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,766 INFO L273 TraceCheckUtils]: 46: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,767 INFO L273 TraceCheckUtils]: 47: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!(~j~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#src~0.base, ~#src~0.offset + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !(~j~0 < 100000); {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,769 INFO L273 TraceCheckUtils]: 50: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume true; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} #t~short2 := ~i~0 < 100000; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,771 INFO L273 TraceCheckUtils]: 52: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,772 INFO L273 TraceCheckUtils]: 53: Hoare triple {11968#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 23:00:48,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume true; {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 23:00:48,773 INFO L273 TraceCheckUtils]: 55: Hoare triple {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} #t~short2 := ~i~0 < 100000; {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 23:00:48,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} is VALID [2018-11-18 23:00:48,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {12113#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 23:00:48,776 INFO L273 TraceCheckUtils]: 58: Hoare triple {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume true; {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 23:00:48,777 INFO L273 TraceCheckUtils]: 59: Hoare triple {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} #t~short2 := ~i~0 < 100000; {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 23:00:48,777 INFO L273 TraceCheckUtils]: 60: Hoare triple {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} is VALID [2018-11-18 23:00:48,779 INFO L273 TraceCheckUtils]: 61: Hoare triple {12126#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;call #t~mem3 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);havoc #t~mem3;~i~0 := 1 + ~i~0; {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,779 INFO L273 TraceCheckUtils]: 62: Hoare triple {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume true; {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,780 INFO L273 TraceCheckUtils]: 63: Hoare triple {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} #t~short2 := ~i~0 < 100000; {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume !#t~short2;havoc #t~mem1;havoc #t~short2; {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {12139#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} ~i~0 := 0; {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,784 INFO L273 TraceCheckUtils]: 67: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} assume true; {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,784 INFO L273 TraceCheckUtils]: 68: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} #t~short5 := ~i~0 < 100000; {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,794 INFO L273 TraceCheckUtils]: 70: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,795 INFO L256 TraceCheckUtils]: 71: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} is VALID [2018-11-18 23:00:48,796 INFO L273 TraceCheckUtils]: 72: Hoare triple {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} ~cond := #in~cond; {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} is VALID [2018-11-18 23:00:48,796 INFO L273 TraceCheckUtils]: 73: Hoare triple {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} assume !(0 == ~cond); {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} is VALID [2018-11-18 23:00:48,797 INFO L273 TraceCheckUtils]: 74: Hoare triple {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} assume true; {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} is VALID [2018-11-18 23:00:48,797 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {12171#(exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_2| 8)))))} {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} #79#return; {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-18 23:00:48,798 INFO L273 TraceCheckUtils]: 76: Hoare triple {12155#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))) (= main_~i~0 0))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,798 INFO L273 TraceCheckUtils]: 77: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume true; {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,799 INFO L273 TraceCheckUtils]: 78: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} #t~short5 := ~i~0 < 100000; {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,800 INFO L273 TraceCheckUtils]: 79: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,801 INFO L273 TraceCheckUtils]: 80: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,803 INFO L256 TraceCheckUtils]: 81: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12203#(exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|))))} is VALID [2018-11-18 23:00:48,804 INFO L273 TraceCheckUtils]: 82: Hoare triple {12203#(exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|))))} ~cond := #in~cond; {12207#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:00:48,805 INFO L273 TraceCheckUtils]: 83: Hoare triple {12207#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {12211#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))))} is VALID [2018-11-18 23:00:48,806 INFO L273 TraceCheckUtils]: 84: Hoare triple {12211#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))))} assume true; {12211#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))))} is VALID [2018-11-18 23:00:48,807 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {12211#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_3| 8)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))))} {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} #79#return; {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {12187#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} havoc #t~mem7;havoc #t~mem6;~i~0 := 1 + ~i~0; {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume true; {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,809 INFO L273 TraceCheckUtils]: 88: Hoare triple {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} #t~short5 := ~i~0 < 100000; {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,810 INFO L273 TraceCheckUtils]: 89: Hoare triple {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume #t~short5;call #t~mem4 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} is VALID [2018-11-18 23:00:48,811 INFO L273 TraceCheckUtils]: 90: Hoare triple {12221#(and (= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ |main_~#dst~0.offset| 8)) (select (select |#memory_int| |main_~#src~0.base|) (+ |main_~#src~0.offset| 8))))} assume !!#t~short5;havoc #t~short5;havoc #t~mem4;call #t~mem6 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4); {12234#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-18 23:00:48,812 INFO L256 TraceCheckUtils]: 91: Hoare triple {12234#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12238#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:00:48,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {12238#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {12242#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:00:48,813 INFO L273 TraceCheckUtils]: 93: Hoare triple {12242#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11927#false} is VALID [2018-11-18 23:00:48,813 INFO L273 TraceCheckUtils]: 94: Hoare triple {11927#false} assume !false; {11927#false} is VALID [2018-11-18 23:00:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 462 trivial. 7 not checked. [2018-11-18 23:00:48,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:00:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2018-11-18 23:00:48,857 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 95 [2018-11-18 23:00:48,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:00:48,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-18 23:00:48,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:00:48,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 23:00:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 23:00:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=955, Unknown=3, NotChecked=138, Total=1406 [2018-11-18 23:00:48,990 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 38 states.