java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:06:14,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:06:14,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:06:14,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:06:14,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:06:14,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:06:14,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:06:14,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:06:14,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:06:14,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:06:14,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:06:14,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:06:14,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:06:14,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:06:14,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:06:14,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:06:14,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:06:14,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:06:14,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:06:14,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:06:14,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:06:14,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:06:14,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:06:14,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:06:14,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:06:14,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:06:14,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:06:14,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:06:14,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:06:14,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:06:14,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:06:14,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:06:14,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:06:14,421 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:06:14,422 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:06:14,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:06:14,425 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:06:14,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:06:14,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:06:14,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:06:14,460 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:06:14,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:06:14,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:06:14,462 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:06:14,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:06:14,462 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:06:14,462 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:06:14,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:06:14,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:06:14,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:06:14,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:06:14,463 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:06:14,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:06:14,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:06:14,464 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:06:14,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:06:14,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:06:14,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:06:14,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:06:14,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:06:14,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:14,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:06:14,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:06:14,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:06:14,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:06:14,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:06:14,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:06:14,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:06:14,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:06:14,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:06:14,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:06:14,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:06:14,547 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:06:14,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i [2018-11-23 12:06:14,613 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811170d4f/a5ff9b354e1b420e9fb1a5d3181d6f30/FLAGdc36af2a6 [2018-11-23 12:06:15,098 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:06:15,099 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_true-unreach-call_ground.i [2018-11-23 12:06:15,105 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811170d4f/a5ff9b354e1b420e9fb1a5d3181d6f30/FLAGdc36af2a6 [2018-11-23 12:06:15,416 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811170d4f/a5ff9b354e1b420e9fb1a5d3181d6f30 [2018-11-23 12:06:15,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:06:15,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:06:15,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:15,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:06:15,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:06:15,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8d527e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15, skipping insertion in model container [2018-11-23 12:06:15,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:06:15,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:06:15,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:15,693 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:06:15,721 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:15,751 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:06:15,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15 WrapperNode [2018-11-23 12:06:15,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:15,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:15,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:06:15,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:06:15,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:15,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:06:15,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:06:15,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:06:15,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:06:15,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:06:15,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:06:15,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:06:15,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:06:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:06:15,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:06:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:06:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:06:15,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:06:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:06:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:06:15,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:06:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:06:15,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:06:15,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:06:16,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:06:16,500 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:06:16,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:16 BoogieIcfgContainer [2018-11-23 12:06:16,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:06:16,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:06:16,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:06:16,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:06:16,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:06:15" (1/3) ... [2018-11-23 12:06:16,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a028025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:16, skipping insertion in model container [2018-11-23 12:06:16,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (2/3) ... [2018-11-23 12:06:16,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a028025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:16, skipping insertion in model container [2018-11-23 12:06:16,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:16" (3/3) ... [2018-11-23 12:06:16,513 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_true-unreach-call_ground.i [2018-11-23 12:06:16,524 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:06:16,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:06:16,552 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:06:16,583 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:06:16,584 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:06:16,584 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:06:16,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:06:16,585 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:06:16,585 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:06:16,585 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:06:16,585 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:06:16,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:06:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:06:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:06:16,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:16,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:16,612 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:16,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1224509072, now seen corresponding path program 1 times [2018-11-23 12:06:16,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:16,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 12:06:16,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29#true} is VALID [2018-11-23 12:06:16,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 12:06:16,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2018-11-23 12:06:16,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret7 := main(); {29#true} is VALID [2018-11-23 12:06:16,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#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; {29#true} is VALID [2018-11-23 12:06:16,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 12:06:16,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2018-11-23 12:06:16,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} havoc ~x~0;~x~0 := 0; {30#false} is VALID [2018-11-23 12:06:16,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {30#false} is VALID [2018-11-23 12:06:16,769 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {30#false} is VALID [2018-11-23 12:06:16,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 12:06:16,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 12:06:16,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 12:06:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:16,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:16,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:06:16,782 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:06:16,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:16,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:06:16,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:16,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:06:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:06:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:16,903 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 12:06:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,186 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 12:06:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:06:17,186 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:06:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 12:06:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 12:06:17,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2018-11-23 12:06:17,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,401 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:06:17,401 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:06:17,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:06:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:06:17,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:17,548 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:17,549 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,553 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 12:06:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 12:06:17,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,554 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:17,554 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,558 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 12:06:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 12:06:17,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 12:06:17,565 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-23 12:06:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:17,565 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 12:06:17,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:06:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 12:06:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:06:17,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:17,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:17,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:17,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1351700691, now seen corresponding path program 1 times [2018-11-23 12:06:17,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:17,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:17,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2018-11-23 12:06:17,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {160#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {160#true} is VALID [2018-11-23 12:06:17,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2018-11-23 12:06:17,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #66#return; {160#true} is VALID [2018-11-23 12:06:17,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret7 := main(); {160#true} is VALID [2018-11-23 12:06:17,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {160#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; {162#(= main_~j~0 0)} is VALID [2018-11-23 12:06:17,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {162#(= main_~j~0 0)} assume !(~j~0 < 100000); {161#false} is VALID [2018-11-23 12:06:17,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {161#false} #t~short2 := ~i~0 < 100000; {161#false} is VALID [2018-11-23 12:06:17,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {161#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {161#false} is VALID [2018-11-23 12:06:17,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {161#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {161#false} is VALID [2018-11-23 12:06:17,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {161#false} havoc ~x~0;~x~0 := 0; {161#false} is VALID [2018-11-23 12:06:17,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {161#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {161#false} is VALID [2018-11-23 12:06:17,805 INFO L256 TraceCheckUtils]: 12: Hoare triple {161#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {161#false} is VALID [2018-11-23 12:06:17,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {161#false} ~cond := #in~cond; {161#false} is VALID [2018-11-23 12:06:17,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {161#false} assume 0 == ~cond; {161#false} is VALID [2018-11-23 12:06:17,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {161#false} assume !false; {161#false} is VALID [2018-11-23 12:06:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:17,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:17,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:06:17,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:06:17,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:17,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:06:17,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:06:17,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:06:17,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:17,984 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-11-23 12:06:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,171 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 12:06:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:06:18,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:06:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:06:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:06:18,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 12:06:18,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:18,330 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:06:18,330 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:06:18,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:06:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:06:18,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:18,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,468 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,468 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,473 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 12:06:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:06:18,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,475 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,475 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,480 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 12:06:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:06:18,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:18,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 12:06:18,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2018-11-23 12:06:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:18,485 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 12:06:18,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:06:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:06:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:06:18,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:18,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:18,489 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:18,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1495374293, now seen corresponding path program 1 times [2018-11-23 12:06:18,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:18,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2018-11-23 12:06:18,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {288#true} is VALID [2018-11-23 12:06:18,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2018-11-23 12:06:18,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #66#return; {288#true} is VALID [2018-11-23 12:06:18,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret7 := main(); {288#true} is VALID [2018-11-23 12:06:18,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {288#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; {290#(= main_~j~0 0)} is VALID [2018-11-23 12:06:18,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {290#(= 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; {291#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:18,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(<= main_~j~0 1)} assume !(~j~0 < 100000); {289#false} is VALID [2018-11-23 12:06:18,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {289#false} #t~short2 := ~i~0 < 100000; {289#false} is VALID [2018-11-23 12:06:18,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {289#false} is VALID [2018-11-23 12:06:18,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {289#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {289#false} is VALID [2018-11-23 12:06:18,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#false} havoc ~x~0;~x~0 := 0; {289#false} is VALID [2018-11-23 12:06:18,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {289#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {289#false} is VALID [2018-11-23 12:06:18,744 INFO L256 TraceCheckUtils]: 13: Hoare triple {289#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {289#false} is VALID [2018-11-23 12:06:18,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2018-11-23 12:06:18,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2018-11-23 12:06:18,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2018-11-23 12:06:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:18,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:18,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2018-11-23 12:06:18,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {288#true} is VALID [2018-11-23 12:06:18,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2018-11-23 12:06:18,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #66#return; {288#true} is VALID [2018-11-23 12:06:18,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret7 := main(); {288#true} is VALID [2018-11-23 12:06:18,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {288#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; {310#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:18,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(<= 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; {291#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:18,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(<= main_~j~0 1)} assume !(~j~0 < 100000); {289#false} is VALID [2018-11-23 12:06:18,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {289#false} #t~short2 := ~i~0 < 100000; {289#false} is VALID [2018-11-23 12:06:18,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {289#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {289#false} is VALID [2018-11-23 12:06:18,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {289#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {289#false} is VALID [2018-11-23 12:06:18,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#false} havoc ~x~0;~x~0 := 0; {289#false} is VALID [2018-11-23 12:06:18,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {289#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {289#false} is VALID [2018-11-23 12:06:18,936 INFO L256 TraceCheckUtils]: 13: Hoare triple {289#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {289#false} is VALID [2018-11-23 12:06:18,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {289#false} ~cond := #in~cond; {289#false} is VALID [2018-11-23 12:06:18,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {289#false} assume 0 == ~cond; {289#false} is VALID [2018-11-23 12:06:18,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {289#false} assume !false; {289#false} is VALID [2018-11-23 12:06:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:06:18,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:06:18,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:18,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:19,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:19,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:19,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:19,151 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-11-23 12:06:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,416 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 12:06:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:06:19,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:06:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:06:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:06:19,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-23 12:06:19,600 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-23 12:06:19,602 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:06:19,602 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:06:19,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:06:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 12:06:19,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:19,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:19,614 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:19,614 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,617 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:06:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:06:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,618 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:19,618 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,620 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 12:06:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:06:19,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:19,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 12:06:19,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2018-11-23 12:06:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:19,624 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 12:06:19,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 12:06:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:06:19,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:19,625 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:19,625 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:19,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash -439614419, now seen corresponding path program 2 times [2018-11-23 12:06:19,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:19,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2018-11-23 12:06:19,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {472#true} is VALID [2018-11-23 12:06:19,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 12:06:19,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #66#return; {472#true} is VALID [2018-11-23 12:06:19,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret7 := main(); {472#true} is VALID [2018-11-23 12:06:19,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {472#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; {474#(= main_~j~0 0)} is VALID [2018-11-23 12:06:19,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#(= 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; {475#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:19,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#(<= 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; {476#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:19,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {476#(<= main_~j~0 2)} assume !(~j~0 < 100000); {473#false} is VALID [2018-11-23 12:06:19,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {473#false} #t~short2 := ~i~0 < 100000; {473#false} is VALID [2018-11-23 12:06:19,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {473#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {473#false} is VALID [2018-11-23 12:06:19,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {473#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {473#false} is VALID [2018-11-23 12:06:19,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {473#false} havoc ~x~0;~x~0 := 0; {473#false} is VALID [2018-11-23 12:06:19,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {473#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {473#false} is VALID [2018-11-23 12:06:19,745 INFO L256 TraceCheckUtils]: 14: Hoare triple {473#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {473#false} is VALID [2018-11-23 12:06:19,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2018-11-23 12:06:19,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2018-11-23 12:06:19,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {473#false} assume !false; {473#false} is VALID [2018-11-23 12:06:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:19,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:19,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:19,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:06:19,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:19,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2018-11-23 12:06:19,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {472#true} is VALID [2018-11-23 12:06:19,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 12:06:19,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #66#return; {472#true} is VALID [2018-11-23 12:06:19,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret7 := main(); {472#true} is VALID [2018-11-23 12:06:19,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {472#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; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(<= 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; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {495#(<= 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; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {495#(<= main_~i~0 0)} assume !(~j~0 < 100000); {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {495#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {495#(<= 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; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {495#(<= main_~i~0 0)} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {495#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:19,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {495#(<= main_~i~0 0)} havoc ~x~0;~x~0 := 0; {517#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 12:06:19,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {473#false} is VALID [2018-11-23 12:06:19,976 INFO L256 TraceCheckUtils]: 14: Hoare triple {473#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {473#false} is VALID [2018-11-23 12:06:19,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2018-11-23 12:06:19,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2018-11-23 12:06:19,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {473#false} assume !false; {473#false} is VALID [2018-11-23 12:06:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:06:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 12:06:19,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 12:06:19,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:19,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:06:20,065 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-23 12:06:20,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:06:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:06:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:20,066 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2018-11-23 12:06:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,405 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:06:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:06:20,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 12:06:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 12:06:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 12:06:20,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2018-11-23 12:06:20,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,498 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:06:20,498 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:06:20,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:06:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:06:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:20,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:20,524 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:20,524 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,527 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:06:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:06:20,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,528 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:20,529 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,531 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:06:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:06:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:20,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:06:20,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2018-11-23 12:06:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:20,535 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:06:20,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:06:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:06:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:06:20,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:20,536 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:20,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:20,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1487652678, now seen corresponding path program 1 times [2018-11-23 12:06:20,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:20,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2018-11-23 12:06:20,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {688#true} is VALID [2018-11-23 12:06:20,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {688#true} assume true; {688#true} is VALID [2018-11-23 12:06:20,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {688#true} {688#true} #66#return; {688#true} is VALID [2018-11-23 12:06:20,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {688#true} call #t~ret7 := main(); {688#true} is VALID [2018-11-23 12:06:20,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {688#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; {690#(= main_~j~0 0)} is VALID [2018-11-23 12:06:20,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {690#(= 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; {691#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:20,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(<= 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; {692#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:20,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {692#(<= 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; {693#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:20,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {693#(<= main_~j~0 3)} assume !(~j~0 < 100000); {689#false} is VALID [2018-11-23 12:06:20,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {689#false} #t~short2 := ~i~0 < 100000; {689#false} is VALID [2018-11-23 12:06:20,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {689#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {689#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {689#false} is VALID [2018-11-23 12:06:20,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {689#false} #t~short2 := ~i~0 < 100000; {689#false} is VALID [2018-11-23 12:06:20,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {689#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {689#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {689#false} havoc ~x~0;~x~0 := 0; {689#false} is VALID [2018-11-23 12:06:20,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {689#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {689#false} is VALID [2018-11-23 12:06:20,676 INFO L256 TraceCheckUtils]: 18: Hoare triple {689#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {689#false} is VALID [2018-11-23 12:06:20,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {689#false} ~cond := #in~cond; {689#false} is VALID [2018-11-23 12:06:20,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {689#false} assume 0 == ~cond; {689#false} is VALID [2018-11-23 12:06:20,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {689#false} assume !false; {689#false} is VALID [2018-11-23 12:06:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:20,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:20,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:20,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2018-11-23 12:06:20,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {688#true} is VALID [2018-11-23 12:06:20,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {688#true} assume true; {688#true} is VALID [2018-11-23 12:06:20,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {688#true} {688#true} #66#return; {688#true} is VALID [2018-11-23 12:06:20,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {688#true} call #t~ret7 := main(); {688#true} is VALID [2018-11-23 12:06:20,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {688#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-23 12:06:20,961 INFO L273 TraceCheckUtils]: 6: 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; {691#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:20,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(<= 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; {692#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:20,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {692#(<= 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; {693#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:20,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {693#(<= main_~j~0 3)} assume !(~j~0 < 100000); {689#false} is VALID [2018-11-23 12:06:20,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {689#false} #t~short2 := ~i~0 < 100000; {689#false} is VALID [2018-11-23 12:06:20,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {689#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {689#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {689#false} is VALID [2018-11-23 12:06:20,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {689#false} #t~short2 := ~i~0 < 100000; {689#false} is VALID [2018-11-23 12:06:20,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {689#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {689#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {689#false} is VALID [2018-11-23 12:06:20,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {689#false} havoc ~x~0;~x~0 := 0; {689#false} is VALID [2018-11-23 12:06:20,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {689#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {689#false} is VALID [2018-11-23 12:06:20,966 INFO L256 TraceCheckUtils]: 18: Hoare triple {689#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {689#false} is VALID [2018-11-23 12:06:20,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {689#false} ~cond := #in~cond; {689#false} is VALID [2018-11-23 12:06:20,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {689#false} assume 0 == ~cond; {689#false} is VALID [2018-11-23 12:06:20,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {689#false} assume !false; {689#false} is VALID [2018-11-23 12:06:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:20,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:20,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:06:20,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:06:20,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:20,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:06:21,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:21,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:06:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:06:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:21,016 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2018-11-23 12:06:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,177 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:06:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:06:21,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:06:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 12:06:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 12:06:21,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-23 12:06:21,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:21,241 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:06:21,241 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:06:21,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-23 12:06:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:06:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:06:21,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:21,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:21,272 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:21,272 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,274 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:06:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:06:21,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,275 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:21,275 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,276 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:06:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:06:21,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:21,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:06:21,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2018-11-23 12:06:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:21,280 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:06:21,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:06:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:06:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:06:21,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:21,281 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:21,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:21,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash -322534046, now seen corresponding path program 2 times [2018-11-23 12:06:21,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:21,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2018-11-23 12:06:21,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {916#true} is VALID [2018-11-23 12:06:21,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2018-11-23 12:06:21,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #66#return; {916#true} is VALID [2018-11-23 12:06:21,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret7 := main(); {916#true} is VALID [2018-11-23 12:06:21,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {916#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; {918#(= main_~j~0 0)} is VALID [2018-11-23 12:06:21,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(= 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; {919#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:21,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#(<= 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; {920#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:21,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {920#(<= 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; {921#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:21,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {921#(<= 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; {922#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:21,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {922#(<= main_~j~0 4)} assume !(~j~0 < 100000); {917#false} is VALID [2018-11-23 12:06:21,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {917#false} #t~short2 := ~i~0 < 100000; {917#false} is VALID [2018-11-23 12:06:21,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {917#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {917#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {917#false} is VALID [2018-11-23 12:06:21,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {917#false} #t~short2 := ~i~0 < 100000; {917#false} is VALID [2018-11-23 12:06:21,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {917#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {917#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {917#false} havoc ~x~0;~x~0 := 0; {917#false} is VALID [2018-11-23 12:06:21,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {917#false} is VALID [2018-11-23 12:06:21,497 INFO L256 TraceCheckUtils]: 19: Hoare triple {917#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {917#false} is VALID [2018-11-23 12:06:21,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {917#false} ~cond := #in~cond; {917#false} is VALID [2018-11-23 12:06:21,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {917#false} assume 0 == ~cond; {917#false} is VALID [2018-11-23 12:06:21,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {917#false} assume !false; {917#false} is VALID [2018-11-23 12:06:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:21,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:21,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:21,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:21,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:21,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2018-11-23 12:06:21,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {916#true} is VALID [2018-11-23 12:06:21,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2018-11-23 12:06:21,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #66#return; {916#true} is VALID [2018-11-23 12:06:21,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret7 := main(); {916#true} is VALID [2018-11-23 12:06:21,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {916#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; {941#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:21,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {941#(<= 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; {919#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:21,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#(<= 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; {920#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:21,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {920#(<= 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; {921#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:21,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {921#(<= 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; {922#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:21,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {922#(<= main_~j~0 4)} assume !(~j~0 < 100000); {917#false} is VALID [2018-11-23 12:06:21,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {917#false} #t~short2 := ~i~0 < 100000; {917#false} is VALID [2018-11-23 12:06:21,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {917#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {917#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {917#false} is VALID [2018-11-23 12:06:21,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {917#false} #t~short2 := ~i~0 < 100000; {917#false} is VALID [2018-11-23 12:06:21,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {917#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {917#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {917#false} is VALID [2018-11-23 12:06:21,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {917#false} havoc ~x~0;~x~0 := 0; {917#false} is VALID [2018-11-23 12:06:21,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {917#false} is VALID [2018-11-23 12:06:21,683 INFO L256 TraceCheckUtils]: 19: Hoare triple {917#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {917#false} is VALID [2018-11-23 12:06:21,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {917#false} ~cond := #in~cond; {917#false} is VALID [2018-11-23 12:06:21,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {917#false} assume 0 == ~cond; {917#false} is VALID [2018-11-23 12:06:21,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {917#false} assume !false; {917#false} is VALID [2018-11-23 12:06:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:21,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:21,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:06:21,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:06:21,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:21,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:06:21,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:21,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:06:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:06:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:21,785 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2018-11-23 12:06:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,030 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:06:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:06:22,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:06:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-23 12:06:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-23 12:06:22,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2018-11-23 12:06:22,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,230 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:06:22,230 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:06:22,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:06:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:06:22,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:22,248 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:22,248 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,250 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:06:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:06:22,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,251 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:22,251 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,254 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:06:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:06:22,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:06:22,257 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2018-11-23 12:06:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,257 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:06:22,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:06:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:06:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:06:22,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,259 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:22,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1436405178, now seen corresponding path program 3 times [2018-11-23 12:06:22,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1154#true} is VALID [2018-11-23 12:06:22,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {1154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1154#true} is VALID [2018-11-23 12:06:22,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2018-11-23 12:06:22,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #66#return; {1154#true} is VALID [2018-11-23 12:06:22,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret7 := main(); {1154#true} is VALID [2018-11-23 12:06:22,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {1154#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; {1156#(= main_~j~0 0)} is VALID [2018-11-23 12:06:22,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {1156#(= 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; {1157#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:22,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {1157#(<= 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; {1158#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:22,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {1158#(<= 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; {1159#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:22,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {1159#(<= 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; {1160#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:22,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {1160#(<= 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; {1161#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:22,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {1161#(<= main_~j~0 5)} assume !(~j~0 < 100000); {1155#false} is VALID [2018-11-23 12:06:22,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {1155#false} #t~short2 := ~i~0 < 100000; {1155#false} is VALID [2018-11-23 12:06:22,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {1155#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1155#false} is VALID [2018-11-23 12:06:22,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {1155#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {1155#false} is VALID [2018-11-23 12:06:22,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {1155#false} #t~short2 := ~i~0 < 100000; {1155#false} is VALID [2018-11-23 12:06:22,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1155#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1155#false} is VALID [2018-11-23 12:06:22,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {1155#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1155#false} is VALID [2018-11-23 12:06:22,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1155#false} havoc ~x~0;~x~0 := 0; {1155#false} is VALID [2018-11-23 12:06:22,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {1155#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1155#false} is VALID [2018-11-23 12:06:22,552 INFO L256 TraceCheckUtils]: 20: Hoare triple {1155#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1155#false} is VALID [2018-11-23 12:06:22,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {1155#false} ~cond := #in~cond; {1155#false} is VALID [2018-11-23 12:06:22,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {1155#false} assume 0 == ~cond; {1155#false} is VALID [2018-11-23 12:06:22,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2018-11-23 12:06:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:06:22,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:22,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:22,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:06:22,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:22,696 INFO L478 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-23 12:06:22,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 12:06:22,824 INFO L478 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-23 12:06:22,835 INFO L478 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-23 12:06:22,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 12:06:22,966 INFO L478 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-23 12:06:22,987 INFO L478 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-23 12:06:22,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:22,998 INFO L478 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-23 12:06:23,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:23,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:23,007 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-23 12:06:23,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:06:23,011 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:23,012 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#dst~0.base|, |main_~#src~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#dst~0.base|) 0)) (.cse1 (select (select |#memory_int| |main_~#src~0.base|) 0))) (and (= .cse0 .cse1) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= .cse0 |main_#t~mem5|) (= .cse1 |main_#t~mem6|))) [2018-11-23 12:06:23,012 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem6| |main_#t~mem5|) [2018-11-23 12:06:23,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {1154#true} call ULTIMATE.init(); {1154#true} is VALID [2018-11-23 12:06:23,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {1154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1154#true} is VALID [2018-11-23 12:06:23,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {1154#true} assume true; {1154#true} is VALID [2018-11-23 12:06:23,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1154#true} {1154#true} #66#return; {1154#true} is VALID [2018-11-23 12:06:23,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {1154#true} call #t~ret7 := main(); {1154#true} is VALID [2018-11-23 12:06:23,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {1154#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; {1180#(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-23 12:06:23,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {1180#(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; {1180#(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-23 12:06:23,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {1180#(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; {1180#(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-23 12:06:23,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {1180#(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; {1180#(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-23 12:06:23,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {1180#(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; {1180#(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-23 12:06:23,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1180#(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; {1180#(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-23 12:06:23,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {1180#(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); {1180#(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-23 12:06:23,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {1180#(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; {1180#(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-23 12:06:23,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {1180#(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; {1180#(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-23 12:06:23,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {1180#(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~short2;havoc #t~mem1;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; {1208#(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-23 12:06:23,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {1208#(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; {1208#(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-23 12:06:23,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {1208#(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; {1208#(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-23 12:06:23,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {1208#(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~short2;havoc #t~mem1; {1208#(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-23 12:06:23,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {1208#(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|))} havoc ~x~0;~x~0 := 0; {1221#(and (= main_~x~0 0) (= 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-23 12:06:23,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {1221#(and (= main_~x~0 0) (= 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 !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1225#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2018-11-23 12:06:23,089 INFO L256 TraceCheckUtils]: 20: Hoare triple {1225#(= |main_#t~mem6| |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1229#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:23,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1233#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:06:23,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {1233#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1155#false} is VALID [2018-11-23 12:06:23,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {1155#false} assume !false; {1155#false} is VALID [2018-11-23 12:06:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:06:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:23,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 12:06:23,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 12:06:23,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:23,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:06:23,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:06:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:06:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:23,197 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 14 states. [2018-11-23 12:06:23,458 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 12:06:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,485 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 12:06:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:06:24,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 12:06:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2018-11-23 12:06:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2018-11-23 12:06:24,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2018-11-23 12:06:24,643 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-23 12:06:24,645 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:06:24,645 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:06:24,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:06:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:06:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 12:06:24,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:24,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 12:06:24,768 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 12:06:24,768 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 12:06:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,770 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:06:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:06:24,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,771 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 12:06:24,771 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 12:06:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,773 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:06:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:06:24,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:24,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 12:06:24,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-11-23 12:06:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:24,776 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 12:06:24,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:06:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:06:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:06:24,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:24,778 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:24,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:24,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:24,779 INFO L82 PathProgramCache]: Analyzing trace with hash 293417241, now seen corresponding path program 1 times [2018-11-23 12:06:24,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:24,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:06:24,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:06:24,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:06:24,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #66#return; {1459#true} is VALID [2018-11-23 12:06:24,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret7 := main(); {1459#true} is VALID [2018-11-23 12:06:24,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#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; {1461#(= main_~j~0 0)} is VALID [2018-11-23 12:06:24,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(= 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; {1462#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:24,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {1462#(<= 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; {1463#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:24,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {1463#(<= 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; {1464#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:24,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {1464#(<= 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; {1465#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:24,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {1465#(<= 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; {1466#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:24,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#(<= 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; {1467#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:24,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1467#(<= main_~j~0 6)} assume !(~j~0 < 100000); {1460#false} is VALID [2018-11-23 12:06:24,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {1460#false} #t~short2 := ~i~0 < 100000; {1460#false} is VALID [2018-11-23 12:06:24,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {1460#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1460#false} is VALID [2018-11-23 12:06:24,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {1460#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {1460#false} is VALID [2018-11-23 12:06:24,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {1460#false} #t~short2 := ~i~0 < 100000; {1460#false} is VALID [2018-11-23 12:06:24,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {1460#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1460#false} is VALID [2018-11-23 12:06:24,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1460#false} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {1460#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:06:24,953 INFO L256 TraceCheckUtils]: 21: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1459#true} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {1459#true} ~cond := #in~cond; {1459#true} is VALID [2018-11-23 12:06:24,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {1459#true} assume !(0 == ~cond); {1459#true} is VALID [2018-11-23 12:06:24,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:06:24,954 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1459#true} {1460#false} #70#return; {1460#false} is VALID [2018-11-23 12:06:24,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} havoc #t~mem6;havoc #t~mem5; {1460#false} is VALID [2018-11-23 12:06:24,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {1460#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1460#false} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:06:24,955 INFO L256 TraceCheckUtils]: 29: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:06:24,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:06:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:06:24,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:24,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:25,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:06:25,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 12:06:25,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:06:25,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #66#return; {1459#true} is VALID [2018-11-23 12:06:25,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret7 := main(); {1459#true} is VALID [2018-11-23 12:06:25,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#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; {1486#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:25,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {1486#(<= 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; {1462#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:25,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {1462#(<= 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; {1463#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:25,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {1463#(<= 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; {1464#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:25,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {1464#(<= 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; {1465#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:25,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {1465#(<= 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; {1466#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:25,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {1466#(<= 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; {1467#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:25,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {1467#(<= main_~j~0 6)} assume !(~j~0 < 100000); {1460#false} is VALID [2018-11-23 12:06:25,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {1460#false} #t~short2 := ~i~0 < 100000; {1460#false} is VALID [2018-11-23 12:06:25,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1460#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1460#false} is VALID [2018-11-23 12:06:25,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {1460#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {1460#false} is VALID [2018-11-23 12:06:25,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {1460#false} #t~short2 := ~i~0 < 100000; {1460#false} is VALID [2018-11-23 12:06:25,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {1460#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1460#false} is VALID [2018-11-23 12:06:25,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1460#false} is VALID [2018-11-23 12:06:25,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 12:06:25,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {1460#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:06:25,882 INFO L256 TraceCheckUtils]: 21: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:06:25,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:06:25,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {1460#false} assume !(0 == ~cond); {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {1460#false} assume true; {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1460#false} {1460#false} #70#return; {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} havoc #t~mem6;havoc #t~mem5; {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {1460#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L256 TraceCheckUtils]: 29: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1460#false} is VALID [2018-11-23 12:06:25,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 12:06:25,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 12:06:25,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:06:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:06:25,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:06:25,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 12:06:25,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:06:25,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:06:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:06:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:25,967 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 10 states. [2018-11-23 12:06:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,320 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:06:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:06:26,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-23 12:06:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:06:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:06:26,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2018-11-23 12:06:26,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,423 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:06:26,423 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:06:26,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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-23 12:06:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:06:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:06:26,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:26,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:26,475 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:26,476 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,480 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 12:06:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:06:26,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,480 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:26,481 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,482 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 12:06:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:06:26,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:26,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:06:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:06:26,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 33 [2018-11-23 12:06:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:26,485 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:06:26,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:06:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:06:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:06:26,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:26,486 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:26,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 444066673, now seen corresponding path program 2 times [2018-11-23 12:06:26,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 12:06:26,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 12:06:26,669 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 12:06:26,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #66#return; {1780#true} is VALID [2018-11-23 12:06:26,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret7 := main(); {1780#true} is VALID [2018-11-23 12:06:26,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#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; {1782#(= main_~j~0 0)} is VALID [2018-11-23 12:06:26,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {1782#(= 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; {1783#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:26,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= 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; {1784#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:26,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= 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; {1785#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:26,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= 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; {1786#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:26,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= 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; {1787#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:26,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= 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; {1788#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:26,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= 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; {1789#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:26,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 100000); {1781#false} is VALID [2018-11-23 12:06:26,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} #t~short2 := ~i~0 < 100000; {1781#false} is VALID [2018-11-23 12:06:26,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1781#false} is VALID [2018-11-23 12:06:26,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {1781#false} is VALID [2018-11-23 12:06:26,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} #t~short2 := ~i~0 < 100000; {1781#false} is VALID [2018-11-23 12:06:26,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1781#false} is VALID [2018-11-23 12:06:26,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1781#false} is VALID [2018-11-23 12:06:26,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 12:06:26,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:06:26,682 INFO L256 TraceCheckUtils]: 22: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1780#true} is VALID [2018-11-23 12:06:26,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2018-11-23 12:06:26,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2018-11-23 12:06:26,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 12:06:26,683 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1780#true} {1781#false} #70#return; {1781#false} is VALID [2018-11-23 12:06:26,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} havoc #t~mem6;havoc #t~mem5; {1781#false} is VALID [2018-11-23 12:06:26,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1781#false} is VALID [2018-11-23 12:06:26,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {1781#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:06:26,684 INFO L256 TraceCheckUtils]: 30: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1781#false} is VALID [2018-11-23 12:06:26,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 12:06:26,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 12:06:26,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 12:06:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:06:26,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:26,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:26,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:26,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:26,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:27,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-23 12:06:27,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-23 12:06:27,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-23 12:06:27,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #66#return; {1780#true} is VALID [2018-11-23 12:06:27,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret7 := main(); {1780#true} is VALID [2018-11-23 12:06:27,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#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; {1808#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:27,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {1808#(<= 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; {1783#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:27,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(<= 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; {1784#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:27,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {1784#(<= 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; {1785#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:27,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {1785#(<= 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; {1786#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:27,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= 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; {1787#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:27,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= 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; {1788#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:27,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= 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; {1789#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:27,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 100000); {1781#false} is VALID [2018-11-23 12:06:27,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#false} #t~short2 := ~i~0 < 100000; {1781#false} is VALID [2018-11-23 12:06:27,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {1781#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1781#false} is VALID [2018-11-23 12:06:27,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {1781#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {1781#false} is VALID [2018-11-23 12:06:27,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {1781#false} #t~short2 := ~i~0 < 100000; {1781#false} is VALID [2018-11-23 12:06:27,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {1781#false} is VALID [2018-11-23 12:06:27,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {1781#false} is VALID [2018-11-23 12:06:27,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-23 12:06:27,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {1781#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:06:27,033 INFO L256 TraceCheckUtils]: 22: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1781#false} is VALID [2018-11-23 12:06:27,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 12:06:27,034 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume !(0 == ~cond); {1781#false} is VALID [2018-11-23 12:06:27,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-23 12:06:27,034 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1781#false} {1781#false} #70#return; {1781#false} is VALID [2018-11-23 12:06:27,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} havoc #t~mem6;havoc #t~mem5; {1781#false} is VALID [2018-11-23 12:06:27,035 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1781#false} is VALID [2018-11-23 12:06:27,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {1781#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-23 12:06:27,036 INFO L256 TraceCheckUtils]: 30: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {1781#false} is VALID [2018-11-23 12:06:27,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-23 12:06:27,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-23 12:06:27,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-23 12:06:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:06:27,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:27,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:06:27,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:06:27,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:27,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:27,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:27,109 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 11 states. [2018-11-23 12:06:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,382 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:06:27,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:27,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:06:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-23 12:06:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-23 12:06:27,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2018-11-23 12:06:27,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:27,442 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:06:27,442 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:06:27,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:06:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:06:27,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:27,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:27,502 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:27,503 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,505 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:06:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:06:27,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,505 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:27,506 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,507 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:06:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:06:27,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:27,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:06:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 12:06:27,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-11-23 12:06:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:27,510 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 12:06:27,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:06:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:06:27,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:27,511 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:27,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:27,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 819231769, now seen corresponding path program 3 times [2018-11-23 12:06:27,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:27,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 12:06:27,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 12:06:27,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 12:06:27,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #66#return; {2111#true} is VALID [2018-11-23 12:06:27,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret7 := main(); {2111#true} is VALID [2018-11-23 12:06:27,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#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; {2113#(= main_~j~0 0)} is VALID [2018-11-23 12:06:27,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {2113#(= 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; {2114#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:27,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {2114#(<= 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; {2115#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:27,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {2115#(<= 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; {2116#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:27,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {2116#(<= 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; {2117#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:27,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {2117#(<= 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; {2118#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:27,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {2118#(<= 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; {2119#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:27,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {2119#(<= 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; {2120#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:27,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {2120#(<= 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; {2121#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:27,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {2121#(<= main_~j~0 8)} assume !(~j~0 < 100000); {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {2112#false} #t~short2 := ~i~0 < 100000; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {2112#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {2112#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {2112#false} #t~short2 := ~i~0 < 100000; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {2112#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {2112#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {2112#false} havoc ~x~0;~x~0 := 0; {2112#false} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {2112#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2112#false} is VALID [2018-11-23 12:06:27,720 INFO L256 TraceCheckUtils]: 23: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2111#true} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {2111#true} ~cond := #in~cond; {2111#true} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {2111#true} assume !(0 == ~cond); {2111#true} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 12:06:27,720 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2111#true} {2112#false} #70#return; {2112#false} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {2112#false} havoc #t~mem6;havoc #t~mem5; {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L256 TraceCheckUtils]: 31: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 12:06:27,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 12:06:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:06:27,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:27,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:27,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:27,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:06:27,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:28,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 12:06:28,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 12:06:28,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 12:06:28,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #66#return; {2111#true} is VALID [2018-11-23 12:06:28,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret7 := main(); {2111#true} is VALID [2018-11-23 12:06:28,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {2140#(<= main_~i~0 0)} assume !(~j~0 < 100000); {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {2140#(<= main_~i~0 0)} #t~short2 := ~i~0 < 100000; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {2140#(<= 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; {2140#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:28,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {2140#(<= main_~i~0 0)} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2177#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {2177#(<= main_~i~0 1)} #t~short2 := ~i~0 < 100000; {2177#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {2177#(<= 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; {2177#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {2177#(<= main_~i~0 1)} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2177#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {2177#(<= main_~i~0 1)} havoc ~x~0;~x~0 := 0; {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:06:28,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:06:28,093 INFO L256 TraceCheckUtils]: 23: Hoare triple {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2111#true} is VALID [2018-11-23 12:06:28,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {2111#true} ~cond := #in~cond; {2111#true} is VALID [2018-11-23 12:06:28,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {2111#true} assume !(0 == ~cond); {2111#true} is VALID [2018-11-23 12:06:28,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 12:06:28,095 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2111#true} {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} #70#return; {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:06:28,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} havoc #t~mem6;havoc #t~mem5; {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:06:28,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {2190#(and (<= main_~i~0 1) (<= 0 main_~x~0))} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2215#(and (<= main_~i~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 12:06:28,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {2215#(and (<= main_~i~0 1) (<= 1 main_~x~0))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2112#false} is VALID [2018-11-23 12:06:28,096 INFO L256 TraceCheckUtils]: 31: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2112#false} is VALID [2018-11-23 12:06:28,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 12:06:28,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 12:06:28,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 12:06:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:06:28,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:28,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-23 12:06:28,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:06:28,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:28,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:06:28,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:28,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:06:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:06:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:28,164 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 15 states. [2018-11-23 12:06:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,991 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 12:06:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:06:28,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:06:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2018-11-23 12:06:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2018-11-23 12:06:28,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 66 transitions. [2018-11-23 12:06:29,068 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-23 12:06:29,070 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:06:29,070 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:06:29,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:06:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:06:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:06:29,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:29,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:29,199 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:29,200 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,202 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:06:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:06:29,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,203 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:29,203 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,205 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:06:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:06:29,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:29,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 12:06:29,207 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 35 [2018-11-23 12:06:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:29,207 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 12:06:29,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:06:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:06:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:06:29,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:29,208 INFO L402 BasicCegarLoop]: trace histogram [9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:29,209 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:29,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -524067476, now seen corresponding path program 4 times [2018-11-23 12:06:29,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:29,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {2494#true} call ULTIMATE.init(); {2494#true} is VALID [2018-11-23 12:06:29,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {2494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2494#true} is VALID [2018-11-23 12:06:29,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2018-11-23 12:06:29,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #66#return; {2494#true} is VALID [2018-11-23 12:06:29,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {2494#true} call #t~ret7 := main(); {2494#true} is VALID [2018-11-23 12:06:29,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {2494#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; {2496#(= main_~j~0 0)} is VALID [2018-11-23 12:06:29,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {2496#(= 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; {2497#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:29,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {2497#(<= 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; {2498#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:29,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {2498#(<= 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; {2499#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:29,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {2499#(<= 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; {2500#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:29,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {2500#(<= 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; {2501#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:29,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {2501#(<= 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; {2502#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:29,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {2502#(<= 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; {2503#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:29,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {2503#(<= 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; {2504#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:29,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {2504#(<= 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; {2505#(<= main_~j~0 9)} is VALID [2018-11-23 12:06:29,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {2505#(<= main_~j~0 9)} assume !(~j~0 < 100000); {2495#false} is VALID [2018-11-23 12:06:29,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {2495#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2495#false} is VALID [2018-11-23 12:06:29,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {2495#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2495#false} is VALID [2018-11-23 12:06:29,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {2495#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {2495#false} havoc ~x~0;~x~0 := 0; {2495#false} is VALID [2018-11-23 12:06:29,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {2495#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2495#false} is VALID [2018-11-23 12:06:29,507 INFO L256 TraceCheckUtils]: 27: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2494#true} is VALID [2018-11-23 12:06:29,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2018-11-23 12:06:29,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2018-11-23 12:06:29,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {2494#true} assume true; {2494#true} is VALID [2018-11-23 12:06:29,508 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2494#true} {2495#false} #70#return; {2495#false} is VALID [2018-11-23 12:06:29,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {2495#false} havoc #t~mem6;havoc #t~mem5; {2495#false} is VALID [2018-11-23 12:06:29,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {2495#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2495#false} is VALID [2018-11-23 12:06:29,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {2495#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2495#false} is VALID [2018-11-23 12:06:29,509 INFO L256 TraceCheckUtils]: 35: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2495#false} is VALID [2018-11-23 12:06:29,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {2495#false} ~cond := #in~cond; {2495#false} is VALID [2018-11-23 12:06:29,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {2495#false} assume 0 == ~cond; {2495#false} is VALID [2018-11-23 12:06:29,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2018-11-23 12:06:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:06:29,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:29,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:29,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:29,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:29,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:29,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {2494#true} call ULTIMATE.init(); {2494#true} is VALID [2018-11-23 12:06:29,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {2494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2494#true} is VALID [2018-11-23 12:06:29,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2018-11-23 12:06:29,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #66#return; {2494#true} is VALID [2018-11-23 12:06:29,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {2494#true} call #t~ret7 := main(); {2494#true} is VALID [2018-11-23 12:06:29,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {2494#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; {2524#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:29,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {2524#(<= 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; {2497#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:29,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {2497#(<= 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; {2498#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:29,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {2498#(<= 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; {2499#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:29,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {2499#(<= 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; {2500#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:29,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {2500#(<= 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; {2501#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:29,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {2501#(<= 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; {2502#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:29,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {2502#(<= 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; {2503#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:29,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {2503#(<= 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; {2504#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:29,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {2504#(<= 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; {2505#(<= main_~j~0 9)} is VALID [2018-11-23 12:06:29,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {2505#(<= main_~j~0 9)} assume !(~j~0 < 100000); {2495#false} is VALID [2018-11-23 12:06:29,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {2495#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2495#false} is VALID [2018-11-23 12:06:29,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {2495#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2495#false} is VALID [2018-11-23 12:06:29,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {2495#false} #t~short2 := ~i~0 < 100000; {2495#false} is VALID [2018-11-23 12:06:29,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {2495#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {2495#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2495#false} is VALID [2018-11-23 12:06:29,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {2495#false} havoc ~x~0;~x~0 := 0; {2495#false} is VALID [2018-11-23 12:06:29,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {2495#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2495#false} is VALID [2018-11-23 12:06:29,690 INFO L256 TraceCheckUtils]: 27: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2495#false} is VALID [2018-11-23 12:06:29,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {2495#false} ~cond := #in~cond; {2495#false} is VALID [2018-11-23 12:06:29,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {2495#false} assume !(0 == ~cond); {2495#false} is VALID [2018-11-23 12:06:29,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {2495#false} assume true; {2495#false} is VALID [2018-11-23 12:06:29,691 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2495#false} {2495#false} #70#return; {2495#false} is VALID [2018-11-23 12:06:29,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {2495#false} havoc #t~mem6;havoc #t~mem5; {2495#false} is VALID [2018-11-23 12:06:29,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {2495#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2495#false} is VALID [2018-11-23 12:06:29,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {2495#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2495#false} is VALID [2018-11-23 12:06:29,691 INFO L256 TraceCheckUtils]: 35: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2495#false} is VALID [2018-11-23 12:06:29,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {2495#false} ~cond := #in~cond; {2495#false} is VALID [2018-11-23 12:06:29,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {2495#false} assume 0 == ~cond; {2495#false} is VALID [2018-11-23 12:06:29,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2018-11-23 12:06:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:06:29,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:06:29,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-23 12:06:29,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:29,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:06:29,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:29,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:06:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:06:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:29,751 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-11-23 12:06:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,026 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:06:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:06:30,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-23 12:06:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 12:06:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 12:06:30,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2018-11-23 12:06:30,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,118 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:06:30,118 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:06:30,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:06:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:06:30,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:30,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:30,191 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:30,192 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,194 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:06:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:06:30,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,194 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:30,195 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,196 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:06:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:06:30,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:30,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 12:06:30,198 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 39 [2018-11-23 12:06:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:30,198 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 12:06:30,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:06:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:06:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:06:30,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:30,199 INFO L402 BasicCegarLoop]: trace histogram [10, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:30,199 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:30,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1013904836, now seen corresponding path program 5 times [2018-11-23 12:06:30,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {2869#true} call ULTIMATE.init(); {2869#true} is VALID [2018-11-23 12:06:30,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {2869#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2869#true} is VALID [2018-11-23 12:06:30,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {2869#true} assume true; {2869#true} is VALID [2018-11-23 12:06:30,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2869#true} {2869#true} #66#return; {2869#true} is VALID [2018-11-23 12:06:30,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {2869#true} call #t~ret7 := main(); {2869#true} is VALID [2018-11-23 12:06:30,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {2869#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; {2871#(= main_~j~0 0)} is VALID [2018-11-23 12:06:30,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(= 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; {2872#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:30,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(<= 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; {2873#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:30,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(<= 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; {2874#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:30,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(<= 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; {2875#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:30,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(<= 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; {2876#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:30,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(<= 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; {2877#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:30,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(<= 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; {2878#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:30,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(<= 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; {2879#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:30,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(<= 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; {2880#(<= main_~j~0 9)} is VALID [2018-11-23 12:06:30,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(<= 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; {2881#(<= main_~j~0 10)} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(<= main_~j~0 10)} assume !(~j~0 < 100000); {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {2870#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {2870#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2870#false} is VALID [2018-11-23 12:06:30,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {2870#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {2870#false} havoc ~x~0;~x~0 := 0; {2870#false} is VALID [2018-11-23 12:06:30,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {2870#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2870#false} is VALID [2018-11-23 12:06:30,566 INFO L256 TraceCheckUtils]: 28: Hoare triple {2870#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2869#true} is VALID [2018-11-23 12:06:30,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {2869#true} ~cond := #in~cond; {2869#true} is VALID [2018-11-23 12:06:30,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {2869#true} assume !(0 == ~cond); {2869#true} is VALID [2018-11-23 12:06:30,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {2869#true} assume true; {2869#true} is VALID [2018-11-23 12:06:30,567 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2869#true} {2870#false} #70#return; {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {2870#false} havoc #t~mem6;havoc #t~mem5; {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 34: Hoare triple {2870#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {2870#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L256 TraceCheckUtils]: 36: Hoare triple {2870#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {2870#false} ~cond := #in~cond; {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 38: Hoare triple {2870#false} assume 0 == ~cond; {2870#false} is VALID [2018-11-23 12:06:30,567 INFO L273 TraceCheckUtils]: 39: Hoare triple {2870#false} assume !false; {2870#false} is VALID [2018-11-23 12:06:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:06:30,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:30,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:30,579 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:30,663 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:06:30,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:30,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:30,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {2869#true} call ULTIMATE.init(); {2869#true} is VALID [2018-11-23 12:06:30,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {2869#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2869#true} is VALID [2018-11-23 12:06:30,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {2869#true} assume true; {2869#true} is VALID [2018-11-23 12:06:30,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2869#true} {2869#true} #66#return; {2869#true} is VALID [2018-11-23 12:06:30,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {2869#true} call #t~ret7 := main(); {2869#true} is VALID [2018-11-23 12:06:30,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {2869#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; {2900#(<= main_~j~0 0)} is VALID [2018-11-23 12:06:30,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {2900#(<= 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; {2872#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:30,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(<= 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; {2873#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:30,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(<= 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; {2874#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:30,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(<= 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; {2875#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:30,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(<= 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; {2876#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:30,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(<= 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; {2877#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:30,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(<= 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; {2878#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:30,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(<= 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; {2879#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:30,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(<= 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; {2880#(<= main_~j~0 9)} is VALID [2018-11-23 12:06:30,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(<= 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; {2881#(<= main_~j~0 10)} is VALID [2018-11-23 12:06:30,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(<= main_~j~0 10)} assume !(~j~0 < 100000); {2870#false} is VALID [2018-11-23 12:06:30,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {2870#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2870#false} is VALID [2018-11-23 12:06:30,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {2870#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {2870#false} is VALID [2018-11-23 12:06:30,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {2870#false} #t~short2 := ~i~0 < 100000; {2870#false} is VALID [2018-11-23 12:06:30,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {2870#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {2870#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {2870#false} is VALID [2018-11-23 12:06:30,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {2870#false} havoc ~x~0;~x~0 := 0; {2870#false} is VALID [2018-11-23 12:06:30,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {2870#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2870#false} is VALID [2018-11-23 12:06:30,863 INFO L256 TraceCheckUtils]: 28: Hoare triple {2870#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2870#false} is VALID [2018-11-23 12:06:30,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {2870#false} ~cond := #in~cond; {2870#false} is VALID [2018-11-23 12:06:30,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {2870#false} assume !(0 == ~cond); {2870#false} is VALID [2018-11-23 12:06:30,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {2870#false} assume true; {2870#false} is VALID [2018-11-23 12:06:30,864 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2870#false} {2870#false} #70#return; {2870#false} is VALID [2018-11-23 12:06:30,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {2870#false} havoc #t~mem6;havoc #t~mem5; {2870#false} is VALID [2018-11-23 12:06:30,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {2870#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2870#false} is VALID [2018-11-23 12:06:30,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {2870#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {2870#false} is VALID [2018-11-23 12:06:30,865 INFO L256 TraceCheckUtils]: 36: Hoare triple {2870#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {2870#false} is VALID [2018-11-23 12:06:30,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {2870#false} ~cond := #in~cond; {2870#false} is VALID [2018-11-23 12:06:30,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {2870#false} assume 0 == ~cond; {2870#false} is VALID [2018-11-23 12:06:30,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {2870#false} assume !false; {2870#false} is VALID [2018-11-23 12:06:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:06:30,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:30,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:06:30,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 12:06:30,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:30,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:06:30,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:06:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:06:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:30,951 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 14 states. [2018-11-23 12:06:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,128 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 12:06:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:06:31,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 12:06:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2018-11-23 12:06:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2018-11-23 12:06:31,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2018-11-23 12:06:31,183 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-23 12:06:31,185 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:06:31,185 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:06:31,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:06:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:06:31,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:31,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:31,289 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:31,289 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,290 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:06:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:06:31,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,291 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:31,291 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,293 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:06:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:06:31,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:31,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 12:06:31,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2018-11-23 12:06:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:31,296 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 12:06:31,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:06:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:06:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:06:31,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:31,297 INFO L402 BasicCegarLoop]: trace histogram [11, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:31,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:31,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:31,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1446406252, now seen corresponding path program 6 times [2018-11-23 12:06:31,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:31,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:32,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {3254#true} call ULTIMATE.init(); {3254#true} is VALID [2018-11-23 12:06:32,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {3254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3254#true} is VALID [2018-11-23 12:06:32,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {3254#true} assume true; {3254#true} is VALID [2018-11-23 12:06:32,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3254#true} {3254#true} #66#return; {3254#true} is VALID [2018-11-23 12:06:32,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {3254#true} call #t~ret7 := main(); {3254#true} is VALID [2018-11-23 12:06:32,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {3254#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; {3256#(= main_~j~0 0)} is VALID [2018-11-23 12:06:32,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {3256#(= 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; {3257#(<= main_~j~0 1)} is VALID [2018-11-23 12:06:32,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {3257#(<= 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; {3258#(<= main_~j~0 2)} is VALID [2018-11-23 12:06:32,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {3258#(<= 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; {3259#(<= main_~j~0 3)} is VALID [2018-11-23 12:06:32,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {3259#(<= 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; {3260#(<= main_~j~0 4)} is VALID [2018-11-23 12:06:32,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {3260#(<= 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; {3261#(<= main_~j~0 5)} is VALID [2018-11-23 12:06:32,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {3261#(<= 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; {3262#(<= main_~j~0 6)} is VALID [2018-11-23 12:06:32,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {3262#(<= 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; {3263#(<= main_~j~0 7)} is VALID [2018-11-23 12:06:32,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {3263#(<= 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; {3264#(<= main_~j~0 8)} is VALID [2018-11-23 12:06:32,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {3264#(<= 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; {3265#(<= main_~j~0 9)} is VALID [2018-11-23 12:06:32,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {3265#(<= 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; {3266#(<= main_~j~0 10)} is VALID [2018-11-23 12:06:32,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {3266#(<= 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; {3267#(<= main_~j~0 11)} is VALID [2018-11-23 12:06:32,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {3267#(<= main_~j~0 11)} assume !(~j~0 < 100000); {3255#false} is VALID [2018-11-23 12:06:32,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {3255#false} #t~short2 := ~i~0 < 100000; {3255#false} is VALID [2018-11-23 12:06:32,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {3255#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3255#false} is VALID [2018-11-23 12:06:32,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {3255#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3255#false} is VALID [2018-11-23 12:06:32,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {3255#false} #t~short2 := ~i~0 < 100000; {3255#false} is VALID [2018-11-23 12:06:32,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3255#false} is VALID [2018-11-23 12:06:32,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {3255#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3255#false} is VALID [2018-11-23 12:06:32,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {3255#false} #t~short2 := ~i~0 < 100000; {3255#false} is VALID [2018-11-23 12:06:32,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {3255#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3255#false} is VALID [2018-11-23 12:06:32,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {3255#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3255#false} is VALID [2018-11-23 12:06:32,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {3255#false} havoc ~x~0;~x~0 := 0; {3255#false} is VALID [2018-11-23 12:06:32,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {3255#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3255#false} is VALID [2018-11-23 12:06:32,266 INFO L256 TraceCheckUtils]: 29: Hoare triple {3255#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3254#true} is VALID [2018-11-23 12:06:32,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {3254#true} ~cond := #in~cond; {3254#true} is VALID [2018-11-23 12:06:32,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {3254#true} assume !(0 == ~cond); {3254#true} is VALID [2018-11-23 12:06:32,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {3254#true} assume true; {3254#true} is VALID [2018-11-23 12:06:32,267 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3254#true} {3255#false} #70#return; {3255#false} is VALID [2018-11-23 12:06:32,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {3255#false} havoc #t~mem6;havoc #t~mem5; {3255#false} is VALID [2018-11-23 12:06:32,267 INFO L273 TraceCheckUtils]: 35: Hoare triple {3255#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3255#false} is VALID [2018-11-23 12:06:32,267 INFO L273 TraceCheckUtils]: 36: Hoare triple {3255#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3255#false} is VALID [2018-11-23 12:06:32,267 INFO L256 TraceCheckUtils]: 37: Hoare triple {3255#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3255#false} is VALID [2018-11-23 12:06:32,267 INFO L273 TraceCheckUtils]: 38: Hoare triple {3255#false} ~cond := #in~cond; {3255#false} is VALID [2018-11-23 12:06:32,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {3255#false} assume 0 == ~cond; {3255#false} is VALID [2018-11-23 12:06:32,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {3255#false} assume !false; {3255#false} is VALID [2018-11-23 12:06:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:06:32,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:32,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:32,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:06:32,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:32,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:32,392 INFO L478 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-23 12:06:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:32,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:32,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 12:06:32,562 INFO L478 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-23 12:06:32,569 INFO L478 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-23 12:06:32,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:32,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:32,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:32,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 12:06:34,801 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) is different from true [2018-11-23 12:06:36,836 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:06:38,923 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 12:06:39,160 INFO L478 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-23 12:06:39,165 INFO L478 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-23 12:06:39,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:39,175 INFO L478 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-23 12:06:39,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:39,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:39,184 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-23 12:06:39,184 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-23 12:06:39,187 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:39,187 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#src~0.base|, |main_~#dst~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#src~0.base|) 4)) (.cse1 (select (select |#memory_int| |main_~#dst~0.base|) 4))) (and (= |main_#t~mem6| .cse0) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= .cse1 .cse0) (= .cse1 |main_#t~mem5|))) [2018-11-23 12:06:39,187 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem6| |main_#t~mem5|) [2018-11-23 12:06:41,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {3254#true} call ULTIMATE.init(); {3254#true} is VALID [2018-11-23 12:06:41,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {3254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3254#true} is VALID [2018-11-23 12:06:41,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {3254#true} assume true; {3254#true} is VALID [2018-11-23 12:06:41,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3254#true} {3254#true} #66#return; {3254#true} is VALID [2018-11-23 12:06:41,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {3254#true} call #t~ret7 := main(); {3254#true} is VALID [2018-11-23 12:06:41,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {3254#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; {3286#(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-23 12:06:41,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {3286#(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; {3286#(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-23 12:06:41,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {3286#(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; {3286#(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-23 12:06:41,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {3286#(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; {3286#(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-23 12:06:41,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {3286#(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; {3286#(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-23 12:06:41,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {3286#(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; {3286#(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-23 12:06:41,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {3286#(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; {3286#(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-23 12:06:41,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {3286#(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; {3286#(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-23 12:06:41,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {3286#(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; {3286#(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-23 12:06:41,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {3286#(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; {3286#(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-23 12:06:41,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {3286#(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; {3286#(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-23 12:06:41,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {3286#(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; {3286#(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-23 12:06:41,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {3286#(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); {3286#(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-23 12:06:41,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {3286#(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; {3286#(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-23 12:06:41,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {3286#(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; {3286#(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-23 12:06:41,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {3286#(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~short2;havoc #t~mem1;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; {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 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; {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {3332#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {3342#(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))) (<= main_~i~0 2) (= 0 |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; {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {3342#(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))) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc ~x~0;~x~0 := 0; {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,292 INFO L256 TraceCheckUtils]: 29: Hoare triple {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3362#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-23 12:06:41,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {3362#(exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4))))} ~cond := #in~cond; {3366#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:06:41,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {3366#(and (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3370#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} is VALID [2018-11-23 12:06:41,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {3370#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} assume true; {3370#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} is VALID [2018-11-23 12:06:41,297 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3370#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_1| |v_main_~#dst~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) 4)))))} {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #70#return; {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc #t~mem6;havoc #t~mem5; {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {3355#(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))) (<= main_~i~0 2) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3383#(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))) (= main_~x~0 1) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:06:41,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {3383#(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))) (= main_~x~0 1) (<= main_~i~0 2) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3387#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2018-11-23 12:06:41,301 INFO L256 TraceCheckUtils]: 37: Hoare triple {3387#(= |main_#t~mem6| |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3391#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:41,302 INFO L273 TraceCheckUtils]: 38: Hoare triple {3391#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3395#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:06:41,302 INFO L273 TraceCheckUtils]: 39: Hoare triple {3395#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3255#false} is VALID [2018-11-23 12:06:41,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {3255#false} assume !false; {3255#false} is VALID [2018-11-23 12:06:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 1 not checked. [2018-11-23 12:06:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:41,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 12:06:41,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-23 12:06:41,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:41,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:06:41,399 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-23 12:06:41,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:06:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:06:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=439, Unknown=2, NotChecked=44, Total=600 [2018-11-23 12:06:41,400 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 25 states. [2018-11-23 12:07:08,519 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 12:07:53,581 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 12:08:16,001 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-23 12:08:22,080 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-23 12:08:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:26,409 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-23 12:08:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:08:26,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-23 12:08:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 89 transitions. [2018-11-23 12:08:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 89 transitions. [2018-11-23 12:08:26,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 89 transitions. [2018-11-23 12:08:26,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:26,546 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:08:26,547 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:08:26,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=321, Invalid=1320, Unknown=3, NotChecked=78, Total=1722 [2018-11-23 12:08:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:08:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-11-23 12:08:26,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:26,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 57 states. [2018-11-23 12:08:26,771 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 57 states. [2018-11-23 12:08:26,771 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 57 states. [2018-11-23 12:08:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:26,774 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 12:08:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 12:08:26,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:26,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:26,775 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 69 states. [2018-11-23 12:08:26,775 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 69 states. [2018-11-23 12:08:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:26,777 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 12:08:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 12:08:26,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:26,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:26,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:26,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:08:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-23 12:08:26,779 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 41 [2018-11-23 12:08:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-23 12:08:26,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:08:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:08:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:08:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:26,780 INFO L402 BasicCegarLoop]: trace histogram [12, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:26,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:26,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash -832991687, now seen corresponding path program 7 times [2018-11-23 12:08:26,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:26,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:26,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:26,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:26,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:27,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {3788#true} call ULTIMATE.init(); {3788#true} is VALID [2018-11-23 12:08:27,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {3788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3788#true} is VALID [2018-11-23 12:08:27,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {3788#true} assume true; {3788#true} is VALID [2018-11-23 12:08:27,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3788#true} {3788#true} #66#return; {3788#true} is VALID [2018-11-23 12:08:27,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {3788#true} call #t~ret7 := main(); {3788#true} is VALID [2018-11-23 12:08:27,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {3788#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; {3790#(= main_~j~0 0)} is VALID [2018-11-23 12:08:27,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {3790#(= 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; {3791#(<= main_~j~0 1)} is VALID [2018-11-23 12:08:27,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {3791#(<= 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; {3792#(<= main_~j~0 2)} is VALID [2018-11-23 12:08:27,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {3792#(<= 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; {3793#(<= main_~j~0 3)} is VALID [2018-11-23 12:08:27,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {3793#(<= 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; {3794#(<= main_~j~0 4)} is VALID [2018-11-23 12:08:27,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {3794#(<= 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; {3795#(<= main_~j~0 5)} is VALID [2018-11-23 12:08:27,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {3795#(<= 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; {3796#(<= main_~j~0 6)} is VALID [2018-11-23 12:08:27,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {3796#(<= 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; {3797#(<= main_~j~0 7)} is VALID [2018-11-23 12:08:27,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {3797#(<= 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; {3798#(<= main_~j~0 8)} is VALID [2018-11-23 12:08:27,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {3798#(<= 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; {3799#(<= main_~j~0 9)} is VALID [2018-11-23 12:08:27,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {3799#(<= 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; {3800#(<= main_~j~0 10)} is VALID [2018-11-23 12:08:27,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {3800#(<= 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; {3801#(<= main_~j~0 11)} is VALID [2018-11-23 12:08:27,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {3801#(<= 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; {3802#(<= main_~j~0 12)} is VALID [2018-11-23 12:08:27,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {3802#(<= main_~j~0 12)} assume !(~j~0 < 100000); {3789#false} is VALID [2018-11-23 12:08:27,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,078 INFO L273 TraceCheckUtils]: 22: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,079 INFO L273 TraceCheckUtils]: 26: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,080 INFO L273 TraceCheckUtils]: 29: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,080 INFO L273 TraceCheckUtils]: 30: Hoare triple {3789#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,080 INFO L273 TraceCheckUtils]: 31: Hoare triple {3789#false} havoc ~x~0;~x~0 := 0; {3789#false} is VALID [2018-11-23 12:08:27,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {3789#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3789#false} is VALID [2018-11-23 12:08:27,081 INFO L256 TraceCheckUtils]: 33: Hoare triple {3789#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3788#true} is VALID [2018-11-23 12:08:27,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {3788#true} ~cond := #in~cond; {3788#true} is VALID [2018-11-23 12:08:27,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {3788#true} assume !(0 == ~cond); {3788#true} is VALID [2018-11-23 12:08:27,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {3788#true} assume true; {3788#true} is VALID [2018-11-23 12:08:27,081 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3788#true} {3789#false} #70#return; {3789#false} is VALID [2018-11-23 12:08:27,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {3789#false} havoc #t~mem6;havoc #t~mem5; {3789#false} is VALID [2018-11-23 12:08:27,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {3789#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3789#false} is VALID [2018-11-23 12:08:27,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {3789#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3789#false} is VALID [2018-11-23 12:08:27,082 INFO L256 TraceCheckUtils]: 41: Hoare triple {3789#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3789#false} is VALID [2018-11-23 12:08:27,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {3789#false} ~cond := #in~cond; {3789#false} is VALID [2018-11-23 12:08:27,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {3789#false} assume 0 == ~cond; {3789#false} is VALID [2018-11-23 12:08:27,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {3789#false} assume !false; {3789#false} is VALID [2018-11-23 12:08:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 12:08:27,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:27,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:27,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:27,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {3788#true} call ULTIMATE.init(); {3788#true} is VALID [2018-11-23 12:08:27,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {3788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3788#true} is VALID [2018-11-23 12:08:27,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {3788#true} assume true; {3788#true} is VALID [2018-11-23 12:08:27,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3788#true} {3788#true} #66#return; {3788#true} is VALID [2018-11-23 12:08:27,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {3788#true} call #t~ret7 := main(); {3788#true} is VALID [2018-11-23 12:08:27,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {3788#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; {3821#(<= main_~j~0 0)} is VALID [2018-11-23 12:08:27,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {3821#(<= 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; {3791#(<= main_~j~0 1)} is VALID [2018-11-23 12:08:27,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {3791#(<= 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; {3792#(<= main_~j~0 2)} is VALID [2018-11-23 12:08:27,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {3792#(<= 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; {3793#(<= main_~j~0 3)} is VALID [2018-11-23 12:08:27,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {3793#(<= 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; {3794#(<= main_~j~0 4)} is VALID [2018-11-23 12:08:27,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {3794#(<= 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; {3795#(<= main_~j~0 5)} is VALID [2018-11-23 12:08:27,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {3795#(<= 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; {3796#(<= main_~j~0 6)} is VALID [2018-11-23 12:08:27,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {3796#(<= 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; {3797#(<= main_~j~0 7)} is VALID [2018-11-23 12:08:27,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {3797#(<= 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; {3798#(<= main_~j~0 8)} is VALID [2018-11-23 12:08:27,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {3798#(<= 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; {3799#(<= main_~j~0 9)} is VALID [2018-11-23 12:08:27,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {3799#(<= 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; {3800#(<= main_~j~0 10)} is VALID [2018-11-23 12:08:27,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {3800#(<= 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; {3801#(<= main_~j~0 11)} is VALID [2018-11-23 12:08:27,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {3801#(<= 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; {3802#(<= main_~j~0 12)} is VALID [2018-11-23 12:08:27,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {3802#(<= main_~j~0 12)} assume !(~j~0 < 100000); {3789#false} is VALID [2018-11-23 12:08:27,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {3789#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {3789#false} #t~short2 := ~i~0 < 100000; {3789#false} is VALID [2018-11-23 12:08:27,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {3789#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {3789#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {3789#false} havoc ~x~0;~x~0 := 0; {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {3789#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L256 TraceCheckUtils]: 33: Hoare triple {3789#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {3789#false} ~cond := #in~cond; {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {3789#false} assume !(0 == ~cond); {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {3789#false} assume true; {3789#false} is VALID [2018-11-23 12:08:27,375 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3789#false} {3789#false} #70#return; {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {3789#false} havoc #t~mem6;havoc #t~mem5; {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {3789#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {3789#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L256 TraceCheckUtils]: 41: Hoare triple {3789#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {3789#false} ~cond := #in~cond; {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 43: Hoare triple {3789#false} assume 0 == ~cond; {3789#false} is VALID [2018-11-23 12:08:27,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {3789#false} assume !false; {3789#false} is VALID [2018-11-23 12:08:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:08:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:08:27,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-23 12:08:27,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:27,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:08:27,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:27,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:08:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:08:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:08:27,431 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 16 states. [2018-11-23 12:08:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:27,812 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-23 12:08:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:08:27,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-23 12:08:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:08:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2018-11-23 12:08:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:08:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2018-11-23 12:08:27,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2018-11-23 12:08:27,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:27,870 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:08:27,870 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:08:27,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:08:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:08:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:08:27,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:27,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:27,990 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:27,990 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:27,992 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:08:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:08:27,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:27,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:27,993 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:27,993 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:27,995 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:08:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:08:27,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:27,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:27,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:27,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:08:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-23 12:08:27,996 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 45 [2018-11-23 12:08:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:27,997 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-23 12:08:27,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:08:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:08:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:08:27,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:27,998 INFO L402 BasicCegarLoop]: trace histogram [13, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:27,998 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:27,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1612154001, now seen corresponding path program 8 times [2018-11-23 12:08:27,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:27,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:28,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:28,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:28,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID [2018-11-23 12:08:28,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4271#true} is VALID [2018-11-23 12:08:28,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID [2018-11-23 12:08:28,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #66#return; {4271#true} is VALID [2018-11-23 12:08:28,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret7 := main(); {4271#true} is VALID [2018-11-23 12:08:28,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {4271#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; {4273#(= main_~j~0 0)} is VALID [2018-11-23 12:08:28,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {4273#(= 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; {4274#(<= main_~j~0 1)} is VALID [2018-11-23 12:08:28,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {4274#(<= 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; {4275#(<= main_~j~0 2)} is VALID [2018-11-23 12:08:28,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {4275#(<= 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; {4276#(<= main_~j~0 3)} is VALID [2018-11-23 12:08:28,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {4276#(<= 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; {4277#(<= main_~j~0 4)} is VALID [2018-11-23 12:08:28,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {4277#(<= 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; {4278#(<= main_~j~0 5)} is VALID [2018-11-23 12:08:28,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {4278#(<= 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; {4279#(<= main_~j~0 6)} is VALID [2018-11-23 12:08:28,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= 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; {4280#(<= main_~j~0 7)} is VALID [2018-11-23 12:08:28,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {4280#(<= 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; {4281#(<= main_~j~0 8)} is VALID [2018-11-23 12:08:28,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {4281#(<= 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; {4282#(<= main_~j~0 9)} is VALID [2018-11-23 12:08:28,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {4282#(<= 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; {4283#(<= main_~j~0 10)} is VALID [2018-11-23 12:08:28,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {4283#(<= 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; {4284#(<= main_~j~0 11)} is VALID [2018-11-23 12:08:28,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {4284#(<= 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; {4285#(<= main_~j~0 12)} is VALID [2018-11-23 12:08:28,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {4285#(<= 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; {4286#(<= main_~j~0 13)} is VALID [2018-11-23 12:08:28,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {4286#(<= main_~j~0 13)} assume !(~j~0 < 100000); {4272#false} is VALID [2018-11-23 12:08:28,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,624 INFO L273 TraceCheckUtils]: 25: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {4272#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {4272#false} havoc ~x~0;~x~0 := 0; {4272#false} is VALID [2018-11-23 12:08:28,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {4272#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4272#false} is VALID [2018-11-23 12:08:28,626 INFO L256 TraceCheckUtils]: 34: Hoare triple {4272#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4271#true} is VALID [2018-11-23 12:08:28,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {4271#true} ~cond := #in~cond; {4271#true} is VALID [2018-11-23 12:08:28,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {4271#true} assume !(0 == ~cond); {4271#true} is VALID [2018-11-23 12:08:28,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {4271#true} assume true; {4271#true} is VALID [2018-11-23 12:08:28,627 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4271#true} {4272#false} #70#return; {4272#false} is VALID [2018-11-23 12:08:28,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {4272#false} havoc #t~mem6;havoc #t~mem5; {4272#false} is VALID [2018-11-23 12:08:28,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {4272#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4272#false} is VALID [2018-11-23 12:08:28,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {4272#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4272#false} is VALID [2018-11-23 12:08:28,628 INFO L256 TraceCheckUtils]: 42: Hoare triple {4272#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4272#false} is VALID [2018-11-23 12:08:28,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2018-11-23 12:08:28,628 INFO L273 TraceCheckUtils]: 44: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID [2018-11-23 12:08:28,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2018-11-23 12:08:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 12:08:28,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:28,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:28,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:28,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:28,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:28,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID [2018-11-23 12:08:28,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4271#true} is VALID [2018-11-23 12:08:28,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID [2018-11-23 12:08:28,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #66#return; {4271#true} is VALID [2018-11-23 12:08:28,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret7 := main(); {4271#true} is VALID [2018-11-23 12:08:28,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {4271#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; {4305#(<= main_~j~0 0)} is VALID [2018-11-23 12:08:28,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {4305#(<= 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; {4274#(<= main_~j~0 1)} is VALID [2018-11-23 12:08:28,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {4274#(<= 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; {4275#(<= main_~j~0 2)} is VALID [2018-11-23 12:08:28,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {4275#(<= 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; {4276#(<= main_~j~0 3)} is VALID [2018-11-23 12:08:28,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {4276#(<= 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; {4277#(<= main_~j~0 4)} is VALID [2018-11-23 12:08:28,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {4277#(<= 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; {4278#(<= main_~j~0 5)} is VALID [2018-11-23 12:08:28,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {4278#(<= 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; {4279#(<= main_~j~0 6)} is VALID [2018-11-23 12:08:28,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= 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; {4280#(<= main_~j~0 7)} is VALID [2018-11-23 12:08:28,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {4280#(<= 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; {4281#(<= main_~j~0 8)} is VALID [2018-11-23 12:08:28,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {4281#(<= 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; {4282#(<= main_~j~0 9)} is VALID [2018-11-23 12:08:28,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {4282#(<= 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; {4283#(<= main_~j~0 10)} is VALID [2018-11-23 12:08:28,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {4283#(<= 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; {4284#(<= main_~j~0 11)} is VALID [2018-11-23 12:08:28,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {4284#(<= 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; {4285#(<= main_~j~0 12)} is VALID [2018-11-23 12:08:28,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {4285#(<= 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; {4286#(<= main_~j~0 13)} is VALID [2018-11-23 12:08:28,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {4286#(<= main_~j~0 13)} assume !(~j~0 < 100000); {4272#false} is VALID [2018-11-23 12:08:28,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {4272#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4272#false} is VALID [2018-11-23 12:08:28,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {4272#false} #t~short2 := ~i~0 < 100000; {4272#false} is VALID [2018-11-23 12:08:28,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {4272#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {4272#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4272#false} is VALID [2018-11-23 12:08:28,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {4272#false} havoc ~x~0;~x~0 := 0; {4272#false} is VALID [2018-11-23 12:08:28,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {4272#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4272#false} is VALID [2018-11-23 12:08:28,927 INFO L256 TraceCheckUtils]: 34: Hoare triple {4272#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4272#false} is VALID [2018-11-23 12:08:28,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2018-11-23 12:08:28,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {4272#false} assume !(0 == ~cond); {4272#false} is VALID [2018-11-23 12:08:28,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {4272#false} assume true; {4272#false} is VALID [2018-11-23 12:08:28,928 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4272#false} {4272#false} #70#return; {4272#false} is VALID [2018-11-23 12:08:28,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {4272#false} havoc #t~mem6;havoc #t~mem5; {4272#false} is VALID [2018-11-23 12:08:28,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {4272#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4272#false} is VALID [2018-11-23 12:08:28,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {4272#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4272#false} is VALID [2018-11-23 12:08:28,928 INFO L256 TraceCheckUtils]: 42: Hoare triple {4272#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4272#false} is VALID [2018-11-23 12:08:28,929 INFO L273 TraceCheckUtils]: 43: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2018-11-23 12:08:28,929 INFO L273 TraceCheckUtils]: 44: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID [2018-11-23 12:08:28,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2018-11-23 12:08:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:08:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:08:28,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 12:08:28,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:28,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:08:28,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:08:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:08:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:08:28,989 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 17 states. [2018-11-23 12:08:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:29,605 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-11-23 12:08:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:08:29,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 12:08:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:08:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:08:29,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2018-11-23 12:08:29,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:29,700 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:08:29,700 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:08:29,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:08:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:08:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 12:08:30,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:30,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:30,501 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:30,501 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:30,505 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:08:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:08:30,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:30,506 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:30,506 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:30,508 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:08:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:08:30,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:30,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:30,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:30,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:08:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-23 12:08:30,511 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 46 [2018-11-23 12:08:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:30,511 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-23 12:08:30,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:08:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:08:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:08:30,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:30,512 INFO L402 BasicCegarLoop]: trace histogram [14, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:30,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:30,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash 102259001, now seen corresponding path program 9 times [2018-11-23 12:08:30,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:30,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:30,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:31,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {4764#true} call ULTIMATE.init(); {4764#true} is VALID [2018-11-23 12:08:31,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {4764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4764#true} is VALID [2018-11-23 12:08:31,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {4764#true} assume true; {4764#true} is VALID [2018-11-23 12:08:31,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4764#true} {4764#true} #66#return; {4764#true} is VALID [2018-11-23 12:08:31,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {4764#true} call #t~ret7 := main(); {4764#true} is VALID [2018-11-23 12:08:31,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {4764#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; {4766#(= main_~j~0 0)} is VALID [2018-11-23 12:08:31,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {4766#(= 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; {4767#(<= main_~j~0 1)} is VALID [2018-11-23 12:08:31,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {4767#(<= 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; {4768#(<= main_~j~0 2)} is VALID [2018-11-23 12:08:31,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {4768#(<= 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; {4769#(<= main_~j~0 3)} is VALID [2018-11-23 12:08:31,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {4769#(<= 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; {4770#(<= main_~j~0 4)} is VALID [2018-11-23 12:08:31,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {4770#(<= 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; {4771#(<= main_~j~0 5)} is VALID [2018-11-23 12:08:31,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {4771#(<= 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; {4772#(<= main_~j~0 6)} is VALID [2018-11-23 12:08:31,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {4772#(<= 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; {4773#(<= main_~j~0 7)} is VALID [2018-11-23 12:08:31,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {4773#(<= 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; {4774#(<= main_~j~0 8)} is VALID [2018-11-23 12:08:31,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {4774#(<= 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; {4775#(<= main_~j~0 9)} is VALID [2018-11-23 12:08:31,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {4775#(<= 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; {4776#(<= main_~j~0 10)} is VALID [2018-11-23 12:08:31,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {4776#(<= 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; {4777#(<= main_~j~0 11)} is VALID [2018-11-23 12:08:31,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {4777#(<= 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; {4778#(<= main_~j~0 12)} is VALID [2018-11-23 12:08:31,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {4778#(<= 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; {4779#(<= main_~j~0 13)} is VALID [2018-11-23 12:08:31,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {4779#(<= 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; {4780#(<= main_~j~0 14)} is VALID [2018-11-23 12:08:31,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {4780#(<= main_~j~0 14)} assume !(~j~0 < 100000); {4765#false} is VALID [2018-11-23 12:08:31,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {4765#false} #t~short2 := ~i~0 < 100000; {4765#false} is VALID [2018-11-23 12:08:31,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {4765#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4765#false} is VALID [2018-11-23 12:08:31,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {4765#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4765#false} is VALID [2018-11-23 12:08:31,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {4765#false} #t~short2 := ~i~0 < 100000; {4765#false} is VALID [2018-11-23 12:08:31,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {4765#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4765#false} is VALID [2018-11-23 12:08:31,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {4765#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4765#false} is VALID [2018-11-23 12:08:31,354 INFO L273 TraceCheckUtils]: 27: Hoare triple {4765#false} #t~short2 := ~i~0 < 100000; {4765#false} is VALID [2018-11-23 12:08:31,354 INFO L273 TraceCheckUtils]: 28: Hoare triple {4765#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4765#false} is VALID [2018-11-23 12:08:31,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {4765#false} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4765#false} is VALID [2018-11-23 12:08:31,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {4765#false} #t~short2 := ~i~0 < 100000; {4765#false} is VALID [2018-11-23 12:08:31,355 INFO L273 TraceCheckUtils]: 31: Hoare triple {4765#false} assume #t~short2;call #t~mem1 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~i~0, 4);#t~short2 := 0 != #t~mem1; {4765#false} is VALID [2018-11-23 12:08:31,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {4765#false} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4765#false} is VALID [2018-11-23 12:08:31,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {4765#false} havoc ~x~0;~x~0 := 0; {4765#false} is VALID [2018-11-23 12:08:31,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {4765#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4765#false} is VALID [2018-11-23 12:08:31,356 INFO L256 TraceCheckUtils]: 35: Hoare triple {4765#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4764#true} is VALID [2018-11-23 12:08:31,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {4764#true} ~cond := #in~cond; {4764#true} is VALID [2018-11-23 12:08:31,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {4764#true} assume !(0 == ~cond); {4764#true} is VALID [2018-11-23 12:08:31,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {4764#true} assume true; {4764#true} is VALID [2018-11-23 12:08:31,357 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4764#true} {4765#false} #70#return; {4765#false} is VALID [2018-11-23 12:08:31,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {4765#false} havoc #t~mem6;havoc #t~mem5; {4765#false} is VALID [2018-11-23 12:08:31,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {4765#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4765#false} is VALID [2018-11-23 12:08:31,357 INFO L273 TraceCheckUtils]: 42: Hoare triple {4765#false} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4765#false} is VALID [2018-11-23 12:08:31,357 INFO L256 TraceCheckUtils]: 43: Hoare triple {4765#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4765#false} is VALID [2018-11-23 12:08:31,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {4765#false} ~cond := #in~cond; {4765#false} is VALID [2018-11-23 12:08:31,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {4765#false} assume 0 == ~cond; {4765#false} is VALID [2018-11-23 12:08:31,358 INFO L273 TraceCheckUtils]: 46: Hoare triple {4765#false} assume !false; {4765#false} is VALID [2018-11-23 12:08:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 12:08:31,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:31,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:31,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:31,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:08:31,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:31,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:31,521 INFO L478 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-23 12:08:31,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 12:08:31,697 INFO L478 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-23 12:08:31,706 INFO L478 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-23 12:08:31,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 12:08:31,858 INFO L478 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 39 treesize of output 38 [2018-11-23 12:08:31,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:08:31,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 45 [2018-11-23 12:08:31,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:31,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:08:31,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-11-23 12:08:34,211 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (.cse0 (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|))) (and (= (select .cse0 4) (select .cse1 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (let ((.cse2 (* 4 v_main_~i~0_14))) (= (select .cse1 .cse2) (select .cse0 .cse2)))))) is different from true [2018-11-23 12:08:36,308 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 12:08:38,419 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 12:08:38,589 INFO L478 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 41 treesize of output 33 [2018-11-23 12:08:38,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:08:38,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 12:08:38,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:38,648 INFO L478 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-23 12:08:38,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:08:38,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:08:38,660 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-23 12:08:38,660 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-11-23 12:08:38,664 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:08:38,664 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#src~0.base|, v_main_~i~0_14, |main_~#dst~0.base|]. (let ((.cse3 (select |#memory_int| |main_~#dst~0.base|)) (.cse1 (select |#memory_int| |main_~#src~0.base|))) (let ((.cse0 (select .cse1 4)) (.cse4 (select .cse3 4))) (and (= |main_#t~mem6| .cse0) (let ((.cse2 (* 4 v_main_~i~0_14))) (= (select .cse1 .cse2) (select .cse3 .cse2))) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (<= 2 v_main_~i~0_14) (= .cse4 .cse0) (= .cse4 |main_#t~mem5|)))) [2018-11-23 12:08:38,664 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem6| |main_#t~mem5|) [2018-11-23 12:08:40,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {4764#true} call ULTIMATE.init(); {4764#true} is VALID [2018-11-23 12:08:40,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {4764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4764#true} is VALID [2018-11-23 12:08:40,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {4764#true} assume true; {4764#true} is VALID [2018-11-23 12:08:40,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4764#true} {4764#true} #66#return; {4764#true} is VALID [2018-11-23 12:08:40,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {4764#true} call #t~ret7 := main(); {4764#true} is VALID [2018-11-23 12:08:40,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {4764#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; {4799#(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-23 12:08:40,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {4799#(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; {4799#(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-23 12:08:40,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {4799#(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; {4799#(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-23 12:08:40,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {4799#(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; {4799#(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-23 12:08:40,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {4799#(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; {4799#(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-23 12:08:40,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {4799#(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; {4799#(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-23 12:08:40,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {4799#(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; {4799#(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-23 12:08:40,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {4799#(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; {4799#(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-23 12:08:40,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {4799#(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; {4799#(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-23 12:08:40,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {4799#(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; {4799#(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-23 12:08:40,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {4799#(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; {4799#(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-23 12:08:40,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {4799#(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; {4799#(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-23 12:08:40,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {4799#(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; {4799#(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-23 12:08:40,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {4799#(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; {4799#(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-23 12:08:40,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {4799#(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; {4799#(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-23 12:08:40,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {4799#(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); {4799#(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-23 12:08:40,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {4799#(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; {4799#(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-23 12:08:40,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {4799#(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; {4799#(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-23 12:08:40,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {4799#(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~short2;havoc #t~mem1;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; {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 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; {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {4854#(and (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= main_~i~0 1) (= 0 |main_~#dst~0.offset|))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4864#(and (<= 2 main_~i~0) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {4864#(and (<= 2 main_~i~0) (= (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|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {4864#(and (<= 2 main_~i~0) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {4864#(and (<= 2 main_~i~0) (= (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|)) (= 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; {4864#(and (<= 2 main_~i~0) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {4864#(and (<= 2 main_~i~0) (= (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|)) (= 0 |main_~#dst~0.offset|))} assume !!#t~short2;havoc #t~short2;havoc #t~mem1;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; {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} #t~short2 := ~i~0 < 100000; {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 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; {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} assume !#t~short2;havoc #t~short2;havoc #t~mem1; {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {4874#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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|)) (= 0 |main_~#dst~0.offset|))} havoc ~x~0;~x~0 := 0; {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,762 INFO L256 TraceCheckUtils]: 35: Hoare triple {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4894#(exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)))))} is VALID [2018-11-23 12:08:40,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {4894#(exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)))))} ~cond := #in~cond; {4898#(and (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:08:40,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {4898#(and (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {4902#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))))} is VALID [2018-11-23 12:08:40,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {4902#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))))} assume true; {4902#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))))} is VALID [2018-11-23 12:08:40,766 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4902#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_main_~i~0_14 Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| 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_2|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (<= 2 v_main_~i~0_14) (= (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14)) (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) (* 4 v_main_~i~0_14))))))} {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #70#return; {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,768 INFO L273 TraceCheckUtils]: 40: Hoare triple {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} havoc #t~mem6;havoc #t~mem5; {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {4887#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 0) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4915#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} is VALID [2018-11-23 12:08:40,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {4915#(and (exists ((v_main_~i~0_14 Int)) (and (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#src~0.offset|)) (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 v_main_~i~0_14) |main_~#dst~0.offset|))) (<= 2 v_main_~i~0_14))) (= (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))) (= main_~x~0 1) (= 0 |main_~#src~0.offset|) (not (= |main_~#src~0.base| |main_~#dst~0.base|)) (= 0 |main_~#dst~0.offset|))} assume !!(~x~0 < ~i~0);call #t~mem5 := read~int(~#dst~0.base, ~#dst~0.offset + 4 * ~x~0, 4);call #t~mem6 := read~int(~#src~0.base, ~#src~0.offset + 4 * ~x~0, 4); {4919#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2018-11-23 12:08:40,772 INFO L256 TraceCheckUtils]: 43: Hoare triple {4919#(= |main_#t~mem6| |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1 else 0)); {4923#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:08:40,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {4923#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4927#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:08:40,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {4927#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4765#false} is VALID [2018-11-23 12:08:40,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {4765#false} assume !false; {4765#false} is VALID [2018-11-23 12:08:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 1 not checked. [2018-11-23 12:08:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-11-23 12:08:40,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-11-23 12:08:40,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:40,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:08:40,884 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-23 12:08:40,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:08:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:08:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=596, Unknown=2, NotChecked=52, Total=812 [2018-11-23 12:08:40,886 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 29 states.